/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:40:07,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:40:07,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:40:07,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:40:07,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:40:07,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:40:07,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:40:07,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:40:07,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:40:07,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:40:07,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:40:07,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:40:07,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:40:07,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:40:07,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:40:07,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:40:07,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:40:07,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:40:07,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:40:07,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:40:07,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:40:07,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:40:07,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:40:07,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:40:07,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:40:07,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:40:07,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:40:07,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:40:07,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:40:07,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:40:07,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:40:07,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:40:07,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:40:07,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:40:07,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:40:07,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:40:07,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:40:07,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:40:07,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:40:07,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:40:07,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:40:07,395 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:40:07,409 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:40:07,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:40:07,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:40:07,410 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:40:07,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:40:07,411 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:40:07,411 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:40:07,411 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:40:07,411 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:40:07,411 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:40:07,411 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:40:07,412 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:40:07,412 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:40:07,412 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:40:07,412 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:40:07,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:40:07,413 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:40:07,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:40:07,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:40:07,413 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:40:07,413 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:40:07,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:40:07,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:40:07,414 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:40:07,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:40:07,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:40:07,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:40:07,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:40:07,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:40:07,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:40:07,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:40:07,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:40:07,600 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:40:07,600 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:40:07,601 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:40:07,675 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_U9mk4L/tmp/5b0313b9fed84a6e9ad3fd5e82a0e538/FLAG31af3c143 [2020-07-01 11:40:08,015 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:40:08,016 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:40:08,022 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_U9mk4L/tmp/5b0313b9fed84a6e9ad3fd5e82a0e538/FLAG31af3c143 [2020-07-01 11:40:08,426 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_U9mk4L/tmp/5b0313b9fed84a6e9ad3fd5e82a0e538 [2020-07-01 11:40:08,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:40:08,438 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:40:08,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:40:08,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:40:08,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:40:08,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3852a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08, skipping insertion in model container [2020-07-01 11:40:08,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:40:08,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:40:08,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:40:08,707 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:40:08,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:40:08,740 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:40:08,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08 WrapperNode [2020-07-01 11:40:08,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:40:08,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:40:08,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:40:08,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:40:08,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:40:08,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:40:08,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:40:08,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:40:08,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (1/1) ... [2020-07-01 11:40:08,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:40:08,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:40:08,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:40:08,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:40:08,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:40:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:40:08,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:40:09,042 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:40:09,042 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-01 11:40:09,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:40:09 BoogieIcfgContainer [2020-07-01 11:40:09,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:40:09,047 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:40:09,047 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:40:09,050 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:40:09,050 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:40:09" (1/1) ... [2020-07-01 11:40:09,062 INFO L313 BlockEncoder]: Initial Icfg 14 locations, 23 edges [2020-07-01 11:40:09,064 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:40:09,064 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:40:09,065 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:40:09,065 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:40:09,067 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:40:09,068 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:40:09,068 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:40:09,084 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:40:09,092 INFO L200 BlockEncoder]: SBE split 0 edges [2020-07-01 11:40:09,097 INFO L70 emoveInfeasibleEdges]: Removed 5 edges and 0 locations because of local infeasibility [2020-07-01 11:40:09,099 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:40:09,120 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 11:40:09,123 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 11:40:09,124 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:40:09,124 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:40:09,124 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:40:09,125 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:40:09,125 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 10 edges [2020-07-01 11:40:09,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:40:09 BasicIcfg [2020-07-01 11:40:09,126 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:40:09,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:40:09,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:40:09,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:40:09,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:40:08" (1/4) ... [2020-07-01 11:40:09,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636ce5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:40:09, skipping insertion in model container [2020-07-01 11:40:09,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (2/4) ... [2020-07-01 11:40:09,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636ce5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:40:09, skipping insertion in model container [2020-07-01 11:40:09,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:40:09" (3/4) ... [2020-07-01 11:40:09,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636ce5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:40:09, skipping insertion in model container [2020-07-01 11:40:09,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:40:09" (4/4) ... [2020-07-01 11:40:09,136 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:40:09,148 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:40:09,155 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 11:40:09,169 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 11:40:09,192 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:40:09,193 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:40:09,193 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:40:09,193 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:40:09,193 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:40:09,193 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:40:09,193 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:40:09,194 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:40:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-07-01 11:40:09,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:40:09,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-07-01 11:40:09,278 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:40:09,279 INFO L271 CegarLoopResult]: At program point L25-2(lines 25 27) the Hoare annotation is: true [2020-07-01 11:40:09,279 INFO L271 CegarLoopResult]: At program point L23-2(lines 23 29) the Hoare annotation is: true [2020-07-01 11:40:09,279 INFO L271 CegarLoopResult]: At program point L20-2(lines 20 31) the Hoare annotation is: true [2020-07-01 11:40:09,279 INFO L271 CegarLoopResult]: At program point L18-2(lines 18 33) the Hoare annotation is: true [2020-07-01 11:40:09,280 INFO L271 CegarLoopResult]: At program point L15-2(lines 15 35) the Hoare annotation is: true [2020-07-01 11:40:09,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:40:09 BasicIcfg [2020-07-01 11:40:09,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:40:09,289 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:40:09,289 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:40:09,292 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:40:09,293 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:40:09,294 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:40:08" (1/5) ... [2020-07-01 11:40:09,294 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bda6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:40:09, skipping insertion in model container [2020-07-01 11:40:09,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:40:09,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:08" (2/5) ... [2020-07-01 11:40:09,295 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bda6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:40:09, skipping insertion in model container [2020-07-01 11:40:09,295 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:40:09,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:40:09" (3/5) ... [2020-07-01 11:40:09,296 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bda6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:40:09, skipping insertion in model container [2020-07-01 11:40:09,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:40:09,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:40:09" (4/5) ... [2020-07-01 11:40:09,296 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bda6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:40:09, skipping insertion in model container [2020-07-01 11:40:09,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:40:09,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:40:09" (5/5) ... [2020-07-01 11:40:09,298 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:40:09,325 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:40:09,325 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:40:09,326 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:40:09,326 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:40:09,326 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:40:09,326 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:40:09,326 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:40:09,326 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:40:09,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-01 11:40:09,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 11:40:09,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:40:09,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:40:09,352 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:40:09,353 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 11:40:09,353 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:40:09,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-01 11:40:09,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 11:40:09,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:40:09,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:40:09,354 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:40:09,354 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 11:40:09,359 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 8#L15-2true [2020-07-01 11:40:09,360 INFO L796 eck$LassoCheckResult]: Loop: 8#L15-2true [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 5#L18-2true [99] L18-2-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1)) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 8#L15-2true [2020-07-01 11:40:09,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:09,367 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2020-07-01 11:40:09,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:09,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549034348] [2020-07-01 11:40:09,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:09,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:09,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash 3881, now seen corresponding path program 1 times [2020-07-01 11:40:09,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:09,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379777504] [2020-07-01 11:40:09,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:09,464 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:09,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash 112474, now seen corresponding path program 1 times [2020-07-01 11:40:09,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:09,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747657586] [2020-07-01 11:40:09,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:09,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747657586] [2020-07-01 11:40:09,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:09,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:40:09,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255655261] [2020-07-01 11:40:09,580 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:40:09,581 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:40:09,581 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:40:09,581 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:40:09,581 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:40:09,581 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:40:09,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:40:09,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:40:09,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:40:09,582 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:40:09,582 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:40:09,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:09,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:09,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:09,721 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:40:09,722 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:40:09,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:40:09,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:40:09,739 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:40:09,739 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:40:09,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:40:09,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:40:09,778 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:40:09,778 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:40:09,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:40:09,811 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:40:09,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:40:09,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:40:10,298 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:40:10,302 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:40:10,319 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:40:10,320 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:40:10,320 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:40:10,320 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:40:10,320 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:40:10,320 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:40:10,320 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:40:10,320 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:40:10,321 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:40:10,321 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:40:10,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:10,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:10,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:10,399 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:40:10,405 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:40:10,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:40:10,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:40:10,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:40:10,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:40:10,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:40:10,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:40:10,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:40:10,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:40:10,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:40:10,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:40:10,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:40:10,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:40:10,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:40:10,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:40:10,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:40:10,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:40:10,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:40:10,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:40:10,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:40:10,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:40:10,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:40:10,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:40:10,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:40:10,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:40:10,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:40:10,528 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 11:40:10,529 INFO L444 ModelExtractionUtils]: 3 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:40:10,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:40:10,536 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:40:10,536 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:40:10,537 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-01 11:40:10,571 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:40:10,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:10,604 WARN L262 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:40:10,605 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:40:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:10,615 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:40:10,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:40:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:10,664 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 11:40:10,669 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-01 11:40:10,671 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 3 states. [2020-07-01 11:40:10,768 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 3 states. Result 22 states and 39 transitions. Complement of second has 9 states. [2020-07-01 11:40:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-07-01 11:40:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 11:40:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-01 11:40:10,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 1 letters. Loop has 2 letters. [2020-07-01 11:40:10,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:40:10,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-01 11:40:10,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:40:10,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-01 11:40:10,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:40:10,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 39 transitions. [2020-07-01 11:40:10,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 11:40:10,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 39 transitions. [2020-07-01 11:40:10,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-01 11:40:10,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-01 11:40:10,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 39 transitions. [2020-07-01 11:40:10,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:40:10,792 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 39 transitions. [2020-07-01 11:40:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 39 transitions. [2020-07-01 11:40:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2020-07-01 11:40:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 11:40:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2020-07-01 11:40:10,823 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 26 transitions. [2020-07-01 11:40:10,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:10,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:40:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:40:10,827 INFO L87 Difference]: Start difference. First operand 15 states and 26 transitions. Second operand 4 states. [2020-07-01 11:40:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:10,865 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2020-07-01 11:40:10,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:40:10,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 35 transitions. [2020-07-01 11:40:10,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 11:40:10,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 11 states and 18 transitions. [2020-07-01 11:40:10,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-01 11:40:10,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-01 11:40:10,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 18 transitions. [2020-07-01 11:40:10,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:40:10,872 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-07-01 11:40:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 18 transitions. [2020-07-01 11:40:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2020-07-01 11:40:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:40:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2020-07-01 11:40:10,873 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 11 transitions. [2020-07-01 11:40:10,874 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 11 transitions. [2020-07-01 11:40:10,874 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 11:40:10,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 11 transitions. [2020-07-01 11:40:10,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 11:40:10,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:40:10,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:40:10,875 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:40:10,875 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:40:10,876 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 119#L15-2 [2020-07-01 11:40:10,876 INFO L796 eck$LassoCheckResult]: Loop: 119#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 117#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 116#L20-2 [101] L20-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 120#L18-2 [99] L18-2-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1)) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 119#L15-2 [2020-07-01 11:40:10,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:10,876 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 2 times [2020-07-01 11:40:10,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:10,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891887342] [2020-07-01 11:40:10,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:10,882 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:10,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:10,883 INFO L82 PathProgramCache]: Analyzing trace with hash 3708846, now seen corresponding path program 1 times [2020-07-01 11:40:10,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:10,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326997430] [2020-07-01 11:40:10,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:10,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326997430] [2020-07-01 11:40:10,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:10,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:40:10,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635487424] [2020-07-01 11:40:10,911 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:40:10,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:10,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:40:10,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:40:10,912 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-01 11:40:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:10,957 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-07-01 11:40:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:40:10,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2020-07-01 11:40:10,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 11:40:10,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 17 transitions. [2020-07-01 11:40:10,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-01 11:40:10,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-01 11:40:10,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2020-07-01 11:40:10,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:40:10,961 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 11:40:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2020-07-01 11:40:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2020-07-01 11:40:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 11:40:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-07-01 11:40:10,963 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-07-01 11:40:10,964 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-07-01 11:40:10,964 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 11:40:10,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2020-07-01 11:40:10,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 11:40:10,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:40:10,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:40:10,965 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:40:10,965 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 11:40:10,965 INFO L794 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 145#L15-2 [2020-07-01 11:40:10,966 INFO L796 eck$LassoCheckResult]: Loop: 145#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 146#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 147#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4)) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~l~0_8 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 141#L23-2 [103] L23-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~k~0_12 (- 1)) v_ULTIMATE.start_main_~k~0_11) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 143#L20-2 [101] L20-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 148#L18-2 [99] L18-2-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1)) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 145#L15-2 [2020-07-01 11:40:10,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:10,966 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 3 times [2020-07-01 11:40:10,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:10,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008013208] [2020-07-01 11:40:10,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:10,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:10,973 INFO L82 PathProgramCache]: Analyzing trace with hash -731444409, now seen corresponding path program 1 times [2020-07-01 11:40:10,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:10,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455256687] [2020-07-01 11:40:10,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:11,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455256687] [2020-07-01 11:40:11,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149289775] [2020-07-01 11:40:11,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:40:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:11,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:40:11,042 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:40:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:11,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:40:11,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-01 11:40:11,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157025438] [2020-07-01 11:40:11,085 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:40:11,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:11,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:40:11,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:40:11,085 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-07-01 11:40:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:11,146 INFO L93 Difference]: Finished difference Result 14 states and 22 transitions. [2020-07-01 11:40:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:40:11,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 22 transitions. [2020-07-01 11:40:11,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 11:40:11,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 22 transitions. [2020-07-01 11:40:11,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-01 11:40:11,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-01 11:40:11,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 22 transitions. [2020-07-01 11:40:11,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:40:11,151 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 22 transitions. [2020-07-01 11:40:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 22 transitions. [2020-07-01 11:40:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2020-07-01 11:40:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 11:40:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-01 11:40:11,153 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 11:40:11,153 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 11:40:11,153 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 11:40:11,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. [2020-07-01 11:40:11,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 11:40:11,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:40:11,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:40:11,154 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:40:11,155 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-07-01 11:40:11,155 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 195#L15-2 [2020-07-01 11:40:11,156 INFO L796 eck$LassoCheckResult]: Loop: 195#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 196#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 197#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4)) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~l~0_8 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 191#L23-2 [103] L23-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~k~0_12 (- 1)) v_ULTIMATE.start_main_~k~0_11) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 193#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4)) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~l~0_8 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 199#L23-2 [103] L23-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~k~0_12 (- 1)) v_ULTIMATE.start_main_~k~0_11) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 201#L20-2 [101] L20-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 200#L18-2 [99] L18-2-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1)) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 195#L15-2 [2020-07-01 11:40:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:11,156 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 4 times [2020-07-01 11:40:11,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:11,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203860486] [2020-07-01 11:40:11,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:11,162 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:11,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:11,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1455881376, now seen corresponding path program 2 times [2020-07-01 11:40:11,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:11,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335610530] [2020-07-01 11:40:11,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:40:11,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335610530] [2020-07-01 11:40:11,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:11,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:40:11,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912969596] [2020-07-01 11:40:11,204 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:40:11,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:40:11,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:40:11,206 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-07-01 11:40:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:11,283 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2020-07-01 11:40:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:40:11,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2020-07-01 11:40:11,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 11:40:11,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2020-07-01 11:40:11,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-01 11:40:11,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-01 11:40:11,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2020-07-01 11:40:11,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:40:11,288 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-07-01 11:40:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2020-07-01 11:40:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-07-01 11:40:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 11:40:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2020-07-01 11:40:11,290 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-07-01 11:40:11,290 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-07-01 11:40:11,290 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 11:40:11,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2020-07-01 11:40:11,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 11:40:11,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:40:11,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:40:11,291 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:40:11,291 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 11:40:11,291 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 233#L15-2 [2020-07-01 11:40:11,292 INFO L796 eck$LassoCheckResult]: Loop: 233#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 230#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 231#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4)) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~l~0_8 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 228#L23-2 [82] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~l~0_5 v_ULTIMATE.start_main_~b~0_5) (= v_ULTIMATE.start_main_~m~0_4 (+ v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~j~0_4 v_ULTIMATE.start_main_~k~0_4 v_ULTIMATE.start_main_~l~0_5 1000))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~m~0] 229#L25-2 [104] L25-2-->L23-2: Formula: (and (= (+ v_ULTIMATE.start_main_~l~0_11 1) v_ULTIMATE.start_main_~l~0_10) (< v_ULTIMATE.start_main_~m~0_8 0)) InVars {ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_11, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8} OutVars{ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0] 234#L23-2 [103] L23-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~k~0_12 (- 1)) v_ULTIMATE.start_main_~k~0_11) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 239#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4)) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~l~0_8 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 237#L23-2 [103] L23-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~k~0_12 (- 1)) v_ULTIMATE.start_main_~k~0_11) (<= v_ULTIMATE.start_main_~b~0_7 v_ULTIMATE.start_main_~l~0_9)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 236#L20-2 [101] L20-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (< v_ULTIMATE.start_main_~k~0_10 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 235#L18-2 [99] L18-2-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1)) (<= v_ULTIMATE.start_main_~a~0_7 v_ULTIMATE.start_main_~j~0_11)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 233#L15-2 [2020-07-01 11:40:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 5 times [2020-07-01 11:40:11,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:11,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46999507] [2020-07-01 11:40:11,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:11,299 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:11,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1771364470, now seen corresponding path program 1 times [2020-07-01 11:40:11,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:11,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30286263] [2020-07-01 11:40:11,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 11:40:11,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30286263] [2020-07-01 11:40:11,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:11,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 11:40:11,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752807568] [2020-07-01 11:40:11,358 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:40:11,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:40:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:40:11,359 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-07-01 11:40:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:11,420 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2020-07-01 11:40:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:40:11,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 6 transitions. [2020-07-01 11:40:11,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-01 11:40:11,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 6 transitions. [2020-07-01 11:40:11,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-01 11:40:11,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-01 11:40:11,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2020-07-01 11:40:11,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:40:11,424 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2020-07-01 11:40:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2020-07-01 11:40:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2020-07-01 11:40:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-01 11:40:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2020-07-01 11:40:11,425 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2020-07-01 11:40:11,425 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2020-07-01 11:40:11,425 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 11:40:11,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2020-07-01 11:40:11,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-01 11:40:11,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:40:11,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:40:11,426 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 11:40:11,427 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-01 11:40:11,427 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY [83] ULTIMATE.startENTRY-->L15-2: Formula: (= v_ULTIMATE.start_main_~i~0_1 0) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~l~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~b~0] 264#L15-2 [91] L15-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_5 0) (< v_ULTIMATE.start_main_~i~0_8 100) (= v_ULTIMATE.start_main_~a~0_4 (+ v_ULTIMATE.start_main_~i~0_8 2))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~j~0] 265#L18-2 [74] L18-2-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~a~0_6) (= v_ULTIMATE.start_main_~k~0_5 (+ v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~i~0_9 3))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 266#L20-2 [78] L20-2-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_6 (+ v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~j~0_10 v_ULTIMATE.start_main_~i~0_10 4)) (<= 0 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~l~0_8 0)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~l~0, ULTIMATE.start_main_~b~0] 261#L23-2 [82] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~l~0_5 v_ULTIMATE.start_main_~b~0_5) (= v_ULTIMATE.start_main_~m~0_4 (+ v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~j~0_4 v_ULTIMATE.start_main_~k~0_4 v_ULTIMATE.start_main_~l~0_5 1000))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_4, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4, ULTIMATE.start_main_~l~0=v_ULTIMATE.start_main_~l~0_5, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~m~0] 262#L25-2 [2020-07-01 11:40:11,427 INFO L796 eck$LassoCheckResult]: Loop: 262#L25-2 [88] L25-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~m~0_6 v_ULTIMATE.start_main_~m~0_7) (<= 0 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~m~0] 262#L25-2 [2020-07-01 11:40:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash 108065989, now seen corresponding path program 1 times [2020-07-01 11:40:11,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:11,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318008478] [2020-07-01 11:40:11,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:11,442 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:11,442 INFO L82 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times [2020-07-01 11:40:11,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:11,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211458324] [2020-07-01 11:40:11,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:11,449 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:11,449 INFO L82 PathProgramCache]: Analyzing trace with hash -944921549, now seen corresponding path program 1 times [2020-07-01 11:40:11,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:11,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990709601] [2020-07-01 11:40:11,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:11,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:11,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:40:11 BasicIcfg [2020-07-01 11:40:11,562 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 11:40:11,564 INFO L168 Benchmark]: Toolchain (without parser) took 3125.18 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 561.5 MB in the beginning and 415.5 MB in the end (delta: 146.0 MB). Peak memory consumption was 189.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:40:11,564 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:40:11,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.03 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 561.5 MB in the beginning and 655.0 MB in the end (delta: -93.5 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:40:11,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.14 ms. Allocated memory is still 692.6 MB. Free memory was 655.0 MB in the beginning and 653.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 11:40:11,566 INFO L168 Benchmark]: Boogie Preprocessor took 21.68 ms. Allocated memory is still 692.6 MB. Free memory was 653.9 MB in the beginning and 651.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:40:11,567 INFO L168 Benchmark]: RCFGBuilder took 246.70 ms. Allocated memory is still 692.6 MB. Free memory was 651.7 MB in the beginning and 636.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. [2020-07-01 11:40:11,567 INFO L168 Benchmark]: BlockEncodingV2 took 78.67 ms. Allocated memory is still 692.6 MB. Free memory was 636.1 MB in the beginning and 629.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-07-01 11:40:11,568 INFO L168 Benchmark]: TraceAbstraction took 161.35 ms. Allocated memory is still 692.6 MB. Free memory was 629.6 MB in the beginning and 619.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. [2020-07-01 11:40:11,568 INFO L168 Benchmark]: BuchiAutomizer took 2272.64 ms. Allocated memory is still 692.6 MB. Free memory was 619.8 MB in the beginning and 415.5 MB in the end (delta: 204.3 MB). Peak memory consumption was 204.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:40:11,572 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 23 edges - StatisticsResult: Encoded RCFG 6 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 302.03 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 561.5 MB in the beginning and 655.0 MB in the end (delta: -93.5 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.14 ms. Allocated memory is still 692.6 MB. Free memory was 655.0 MB in the beginning and 653.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 21.68 ms. Allocated memory is still 692.6 MB. Free memory was 653.9 MB in the beginning and 651.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 246.70 ms. Allocated memory is still 692.6 MB. Free memory was 651.7 MB in the beginning and 636.1 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 78.67 ms. Allocated memory is still 692.6 MB. Free memory was 636.1 MB in the beginning and 629.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 161.35 ms. Allocated memory is still 692.6 MB. Free memory was 629.6 MB in the beginning and 619.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2272.64 ms. Allocated memory is still 692.6 MB. Free memory was 619.8 MB in the beginning and 415.5 MB in the end (delta: 204.3 MB). Peak memory consumption was 204.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 0 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 5 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 0 deterministic, 1 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function -1 * i and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 4. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 125 SDslu, 23 SDs, 0 SdLazy, 111 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax166 hnf100 lsp60 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf91 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 25]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {a=2, \result=0, b=7, m=1003, l=0, i=0, k=3, j=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 25]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] int k; [L9] int l; [L10] int m; [L11] int a; [L12] int b; [L13] i = 0 [L15] COND TRUE i < 100 [L16] a = i+2 [L17] j = 0 [L18] COND TRUE j < a [L19] k = i+j+3 [L20] COND TRUE k >= 0 [L21] b = i+j+k+4 [L22] l = 0 [L23] COND TRUE l < b [L24] m = i+j+k+l+1000 Loop: [L25] COND TRUE m >= 0 [L26] m = m-0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-07-01 11:40:05.181 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_U9mk4L/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:40:12.210 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check