/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 13:21:21,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:21:21,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:21:21,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:21:21,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:21:21,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:21:21,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:21:21,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:21:21,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:21:21,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:21:21,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:21:21,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:21:21,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:21:21,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:21:21,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:21:21,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:21:21,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:21:21,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:21:21,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:21:21,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:21:21,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:21:21,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:21:21,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:21:21,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:21:21,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:21:21,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:21:21,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:21:21,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:21:21,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:21:21,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:21:21,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:21:21,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:21:21,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:21:21,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:21:21,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:21:21,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:21:21,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:21:21,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:21:21,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:21:21,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:21:21,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:21:21,754 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:21:21,768 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:21:21,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:21:21,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:21:21,769 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:21:21,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:21:21,770 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:21:21,770 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:21:21,770 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:21:21,770 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:21:21,771 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:21:21,771 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:21:21,771 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:21:21,771 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:21:21,771 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:21:21,771 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:21,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:21:21,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:21:21,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:21:21,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:21:21,772 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:21:21,772 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:21:21,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:21:21,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:21:21,773 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:21:21,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:21:21,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:21:21,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:21:21,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:21:21,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:21:21,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:21:21,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:21:21,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:21:21,963 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:21:21,963 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:21:21,964 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:21:22,022 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_2Ev9fp/tmp/4143ca6df4ea40d68806d83d7e64bf22/FLAGb9434227e [2020-07-01 13:21:22,363 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:21:22,364 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:21:22,370 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_2Ev9fp/tmp/4143ca6df4ea40d68806d83d7e64bf22/FLAGb9434227e [2020-07-01 13:21:22,770 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_2Ev9fp/tmp/4143ca6df4ea40d68806d83d7e64bf22 [2020-07-01 13:21:22,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:21:22,783 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:21:22,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:21:22,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:21:22,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:21:22,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:21:22" (1/1) ... [2020-07-01 13:21:22,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3deac49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:22, skipping insertion in model container [2020-07-01 13:21:22,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:21:22" (1/1) ... [2020-07-01 13:21:22,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:21:22,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:21:23,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:21:23,056 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:21:23,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:21:23,090 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:21:23,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23 WrapperNode [2020-07-01 13:21:23,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:21:23,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:21:23,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:21:23,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:21:23,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (1/1) ... [2020-07-01 13:21:23,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (1/1) ... [2020-07-01 13:21:23,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:21:23,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:21:23,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:21:23,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:21:23,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (1/1) ... [2020-07-01 13:21:23,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (1/1) ... [2020-07-01 13:21:23,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (1/1) ... [2020-07-01 13:21:23,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (1/1) ... [2020-07-01 13:21:23,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (1/1) ... [2020-07-01 13:21:23,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (1/1) ... [2020-07-01 13:21:23,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (1/1) ... [2020-07-01 13:21:23,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:21:23,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:21:23,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:21:23,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:21:23,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (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 13:21:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:21:23,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:21:23,404 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:21:23,404 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 13:21:23,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:21:23 BoogieIcfgContainer [2020-07-01 13:21:23,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:21:23,409 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:21:23,409 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:21:23,411 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:21:23,412 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:21:23" (1/1) ... [2020-07-01 13:21:23,426 INFO L313 BlockEncoder]: Initial Icfg 12 locations, 19 edges [2020-07-01 13:21:23,428 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:21:23,428 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:21:23,429 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:21:23,430 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:21:23,431 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:21:23,432 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:21:23,432 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:21:23,449 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:21:23,467 INFO L200 BlockEncoder]: SBE split 1 edges [2020-07-01 13:21:23,471 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:21:23,473 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:21:23,486 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 13:21:23,488 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:21:23,490 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:21:23,490 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:21:23,490 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:21:23,491 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:21:23,491 INFO L313 BlockEncoder]: Encoded RCFG 8 locations, 15 edges [2020-07-01 13:21:23,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:21:23 BasicIcfg [2020-07-01 13:21:23,492 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:21:23,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:21:23,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:21:23,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:21:23,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:21:22" (1/4) ... [2020-07-01 13:21:23,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a8cf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:21:23, skipping insertion in model container [2020-07-01 13:21:23,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (2/4) ... [2020-07-01 13:21:23,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a8cf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:21:23, skipping insertion in model container [2020-07-01 13:21:23,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:21:23" (3/4) ... [2020-07-01 13:21:23,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a8cf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:21:23, skipping insertion in model container [2020-07-01 13:21:23,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:21:23" (4/4) ... [2020-07-01 13:21:23,501 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:21:23,511 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:21:23,519 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 13:21:23,536 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 13:21:23,560 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:21:23,561 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:21:23,561 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:21:23,561 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:21:23,561 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:21:23,561 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:21:23,561 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:21:23,562 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:21:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2020-07-01 13:21:23,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:21:23,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-07-01 13:21:23,636 INFO L271 CegarLoopResult]: At program point L34-2(lines 11 42) the Hoare annotation is: true [2020-07-01 13:21:23,636 INFO L268 CegarLoopResult]: For program point L16(lines 16 20) no Hoare annotation was computed. [2020-07-01 13:21:23,636 INFO L268 CegarLoopResult]: For program point L14(lines 14 23) no Hoare annotation was computed. [2020-07-01 13:21:23,637 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:21:23,637 INFO L268 CegarLoopResult]: For program point L12(lines 12 40) no Hoare annotation was computed. [2020-07-01 13:21:23,637 INFO L268 CegarLoopResult]: For program point L27(lines 27 31) no Hoare annotation was computed. [2020-07-01 13:21:23,637 INFO L268 CegarLoopResult]: For program point L25(lines 25 39) no Hoare annotation was computed. [2020-07-01 13:21:23,637 INFO L268 CegarLoopResult]: For program point L34(lines 34 38) no Hoare annotation was computed. [2020-07-01 13:21:23,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:21:23 BasicIcfg [2020-07-01 13:21:23,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:21:23,647 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:21:23,647 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:21:23,650 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:21:23,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:21:23,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:21:22" (1/5) ... [2020-07-01 13:21:23,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19a38a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:21:23, skipping insertion in model container [2020-07-01 13:21:23,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:21:23,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:21:23" (2/5) ... [2020-07-01 13:21:23,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19a38a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:21:23, skipping insertion in model container [2020-07-01 13:21:23,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:21:23,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:21:23" (3/5) ... [2020-07-01 13:21:23,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19a38a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:21:23, skipping insertion in model container [2020-07-01 13:21:23,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:21:23,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:21:23" (4/5) ... [2020-07-01 13:21:23,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19a38a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:21:23, skipping insertion in model container [2020-07-01 13:21:23,654 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:21:23,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:21:23" (5/5) ... [2020-07-01 13:21:23,656 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:21:23,682 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:21:23,683 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:21:23,683 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:21:23,683 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:21:23,683 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:21:23,683 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:21:23,683 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:21:23,684 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:21:23,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-01 13:21:23,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 13:21:23,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:23,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:23,712 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 13:21:23,712 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 13:21:23,712 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:21:23,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-01 13:21:23,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 13:21:23,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:23,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:23,714 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 13:21:23,714 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 13:21:23,719 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 4#L34-2true [2020-07-01 13:21:23,719 INFO L796 eck$LassoCheckResult]: Loop: 4#L34-2true [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 7#L12true [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9#L14true [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4#L34-2true [2020-07-01 13:21:23,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:23,726 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2020-07-01 13:21:23,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:23,735 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654122189] [2020-07-01 13:21:23,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:23,805 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:23,806 INFO L82 PathProgramCache]: Analyzing trace with hash 84579, now seen corresponding path program 1 times [2020-07-01 13:21:23,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:23,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392702717] [2020-07-01 13:21:23,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:23,826 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:23,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2527441, now seen corresponding path program 1 times [2020-07-01 13:21:23,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:23,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360192084] [2020-07-01 13:21:23,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:23,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:23,906 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:23,908 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:23,908 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:23,908 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:23,908 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:21:23,909 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:23,909 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:23,909 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:23,909 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 13:21:23,909 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:23,909 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:23,929 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 13:21:23,940 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 13:21:23,944 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 13:21:24,046 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:24,047 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 13:21:24,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:24,053 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:24,063 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:24,063 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 13:21:24,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:24,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:24,102 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:24,102 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 13:21:24,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:24,136 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 13:21:24,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:21:24,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:24,213 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 13:21:24,215 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:24,236 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:24,236 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:24,236 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:24,236 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:21:24,236 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:24,237 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:24,237 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:24,237 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 13:21:24,237 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:24,237 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:24,239 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 13:21:24,244 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 13:21:24,248 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 13:21:24,315 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:24,321 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 13:21:24,325 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 13:21:24,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:21:24,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:21:24,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:21:24,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:21:24,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:21:24,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:21:24,339 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 13:21:24,371 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 13:21:24,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:21:24,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:21:24,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:21:24,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:21:24,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:21:24,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:21:24,383 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 13:21:24,415 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 13:21:24,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:21:24,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:21:24,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:21:24,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:21:24,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:21:24,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:21:24,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:21:24,429 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:21:24,445 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:21:24,445 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 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 13:21:24,450 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:21:24,450 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:21:24,451 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:21:24,451 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-07-01 13:21:24,486 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:21:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:24,528 INFO L264 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 13:21:24,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:24,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 13:21:24,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:24,546 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 13:21:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:24,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 13:21:24,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:24,608 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 13:21:24,614 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 13:21:24,615 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states. Second operand 3 states. [2020-07-01 13:21:24,756 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states.. Second operand 3 states. Result 40 states and 70 transitions. Complement of second has 6 states. [2020-07-01 13:21:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-01 13:21:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 13:21:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-01 13:21:24,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-01 13:21:24,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:24,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-01 13:21:24,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:24,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-01 13:21:24,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:24,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 70 transitions. [2020-07-01 13:21:24,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-07-01 13:21:24,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 70 transitions. [2020-07-01 13:21:24,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-01 13:21:24,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-07-01 13:21:24,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 70 transitions. [2020-07-01 13:21:24,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:24,785 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 70 transitions. [2020-07-01 13:21:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 70 transitions. [2020-07-01 13:21:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-07-01 13:21:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 13:21:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2020-07-01 13:21:24,821 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 66 transitions. [2020-07-01 13:21:24,821 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 66 transitions. [2020-07-01 13:21:24,821 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 13:21:24,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 66 transitions. [2020-07-01 13:21:24,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-07-01 13:21:24,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:24,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:24,824 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:21:24,824 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 13:21:24,825 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 102#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 120#L12 [2020-07-01 13:21:24,825 INFO L796 eck$LassoCheckResult]: Loop: 120#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 124#L25 [69] L25-->L27: Formula: (and (< v_ULTIMATE.start_main_~j~0_23 0) (= v_ULTIMATE.start_main_~i~0_20 (+ v_ULTIMATE.start_main_~i~0_21 (- 1))) (< 0 v_ULTIMATE.start_main_~i~0_21)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_23, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_23, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 125#L27 [76] L27-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 1)) (>= (+ v_ULTIMATE.start_main_~j~0_8 1) 0)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 130#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 120#L12 [2020-07-01 13:21:24,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:24,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2628, now seen corresponding path program 1 times [2020-07-01 13:21:24,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:24,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248508959] [2020-07-01 13:21:24,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:24,833 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:24,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:24,833 INFO L82 PathProgramCache]: Analyzing trace with hash 3137193, now seen corresponding path program 1 times [2020-07-01 13:21:24,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:24,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250589430] [2020-07-01 13:21:24,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:24,876 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 13:21:24,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250589430] [2020-07-01 13:21:24,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:21:24,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:21:24,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836175769] [2020-07-01 13:21:24,882 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:21:24,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:21:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:21:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:21:24,886 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. cyclomatic complexity: 32 Second operand 3 states. [2020-07-01 13:21:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:21:24,925 INFO L93 Difference]: Finished difference Result 32 states and 53 transitions. [2020-07-01 13:21:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:21:24,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 53 transitions. [2020-07-01 13:21:24,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-07-01 13:21:24,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 53 transitions. [2020-07-01 13:21:24,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-01 13:21:24,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-01 13:21:24,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 53 transitions. [2020-07-01 13:21:24,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:24,932 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 53 transitions. [2020-07-01 13:21:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 53 transitions. [2020-07-01 13:21:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 13:21:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:21:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2020-07-01 13:21:24,936 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 53 transitions. [2020-07-01 13:21:24,936 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 53 transitions. [2020-07-01 13:21:24,937 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 13:21:24,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 53 transitions. [2020-07-01 13:21:24,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-07-01 13:21:24,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:24,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:24,939 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:21:24,939 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:21:24,939 INFO L794 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 170#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 172#L12 [2020-07-01 13:21:24,940 INFO L796 eck$LassoCheckResult]: Loop: 172#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 178#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 197#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 183#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 200#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 199#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 175#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 171#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 172#L12 [2020-07-01 13:21:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:24,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2628, now seen corresponding path program 2 times [2020-07-01 13:21:24,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:24,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126238270] [2020-07-01 13:21:24,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:24,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1482931300, now seen corresponding path program 1 times [2020-07-01 13:21:24,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:24,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229249208] [2020-07-01 13:21:24,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:25,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229249208] [2020-07-01 13:21:25,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:21:25,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 13:21:25,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257355521] [2020-07-01 13:21:25,011 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:21:25,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:21:25,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:21:25,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:21:25,011 INFO L87 Difference]: Start difference. First operand 32 states and 53 transitions. cyclomatic complexity: 24 Second operand 6 states. [2020-07-01 13:21:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:21:25,094 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2020-07-01 13:21:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 13:21:25,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 82 transitions. [2020-07-01 13:21:25,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2020-07-01 13:21:25,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 52 states and 81 transitions. [2020-07-01 13:21:25,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-07-01 13:21:25,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-07-01 13:21:25,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 81 transitions. [2020-07-01 13:21:25,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:25,102 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 81 transitions. [2020-07-01 13:21:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 81 transitions. [2020-07-01 13:21:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2020-07-01 13:21:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 13:21:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-07-01 13:21:25,108 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-07-01 13:21:25,108 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-07-01 13:21:25,108 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 13:21:25,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 67 transitions. [2020-07-01 13:21:25,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2020-07-01 13:21:25,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:25,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:25,110 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 13:21:25,110 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-07-01 13:21:25,111 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 270#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 294#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 272#L25 [2020-07-01 13:21:25,111 INFO L796 eck$LassoCheckResult]: Loop: 272#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 285#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 287#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 286#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 282#L25 [79] L25-->L34: Formula: (and (>= 0 v_ULTIMATE.start_main_~i~0_9) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 283#L34 [77] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (>= v_ULTIMATE.start_main_~i~0_13 (* 2 v_ULTIMATE.start_main_~j~0_13))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 296#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 271#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 272#L25 [2020-07-01 13:21:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:25,112 INFO L82 PathProgramCache]: Analyzing trace with hash 81540, now seen corresponding path program 1 times [2020-07-01 13:21:25,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:25,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256758844] [2020-07-01 13:21:25,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:25,130 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 13:21:25,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256758844] [2020-07-01 13:21:25,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:21:25,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 13:21:25,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455049929] [2020-07-01 13:21:25,132 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:21:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1585518670, now seen corresponding path program 1 times [2020-07-01 13:21:25,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:25,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974960465] [2020-07-01 13:21:25,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:25,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974960465] [2020-07-01 13:21:25,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:21:25,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:21:25,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066821575] [2020-07-01 13:21:25,153 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:21:25,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:21:25,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:21:25,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:21:25,154 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. cyclomatic complexity: 27 Second operand 3 states. [2020-07-01 13:21:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:21:25,185 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2020-07-01 13:21:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:21:25,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 67 transitions. [2020-07-01 13:21:25,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2020-07-01 13:21:25,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 67 transitions. [2020-07-01 13:21:25,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-07-01 13:21:25,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-07-01 13:21:25,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 67 transitions. [2020-07-01 13:21:25,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:25,190 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. [2020-07-01 13:21:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 67 transitions. [2020-07-01 13:21:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 13:21:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 13:21:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2020-07-01 13:21:25,195 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. [2020-07-01 13:21:25,195 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. [2020-07-01 13:21:25,196 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 13:21:25,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 67 transitions. [2020-07-01 13:21:25,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2020-07-01 13:21:25,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:25,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:25,197 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 13:21:25,197 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-07-01 13:21:25,198 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 363#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 364#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 365#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 372#L16 [2020-07-01 13:21:25,198 INFO L796 eck$LassoCheckResult]: Loop: 372#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 368#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 391#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 389#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 367#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 369#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 400#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 399#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 361#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 357#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 358#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 395#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 372#L16 [2020-07-01 13:21:25,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:25,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2527434, now seen corresponding path program 1 times [2020-07-01 13:21:25,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:25,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791767091] [2020-07-01 13:21:25,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:25,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1715145731, now seen corresponding path program 1 times [2020-07-01 13:21:25,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:25,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862516996] [2020-07-01 13:21:25,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:25,232 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:25,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1441380172, now seen corresponding path program 1 times [2020-07-01 13:21:25,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:25,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429509586] [2020-07-01 13:21:25,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:25,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:25,371 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:25,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:25,371 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:25,371 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:25,371 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:21:25,371 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:25,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:25,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:25,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 13:21:25,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:25,373 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:25,374 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 13:21:25,379 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 13:21:25,387 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 13:21:25,463 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:25,463 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:25,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:25,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:25,476 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:25,476 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:25,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:25,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:25,513 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:25,513 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:25,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:25,546 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:25,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:21:25,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:25,655 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 13:21:25,657 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:25,657 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:25,658 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:25,658 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:25,658 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:21:25,658 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:25,658 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:25,659 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:25,659 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 13:21:25,659 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:25,659 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:25,661 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 13:21:25,664 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 13:21:25,667 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 13:21:25,774 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:25,774 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:25,778 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 13:21:25,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:21:25,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:21:25,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:21:25,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:21:25,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:21:25,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:21:25,787 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 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:25,819 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 13:21:25,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:21:25,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:21:25,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:21:25,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:21:25,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:21:25,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:21:25,829 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:25,861 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 13:21:25,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:21:25,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:21:25,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:21:25,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:21:25,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:21:25,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:21:25,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:21:25,869 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:21:25,873 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:21:25,873 INFO L444 ModelExtractionUtils]: 1 out of 4 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 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:25,876 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:21:25,876 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:21:25,877 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:21:25,877 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 7 Supporting invariants [] [2020-07-01 13:21:25,907 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:21:25,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:25,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 13:21:25,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:25,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:25,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:25,974 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:25,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:26,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:26,061 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:26,088 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:26,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:26,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:26,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:26,177 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:26,178 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:26,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:26,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:26,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:26,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:26,216 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-07-01 13:21:26,216 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 8 loop predicates [2020-07-01 13:21:26,217 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 44 states and 67 transitions. cyclomatic complexity: 26 Second operand 5 states. [2020-07-01 13:21:26,504 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 44 states and 67 transitions. cyclomatic complexity: 26. Second operand 5 states. Result 391 states and 605 transitions. Complement of second has 51 states. [2020-07-01 13:21:26,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-07-01 13:21:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 13:21:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2020-07-01 13:21:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 4 letters. Loop has 12 letters. [2020-07-01 13:21:26,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:26,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 16 letters. Loop has 12 letters. [2020-07-01 13:21:26,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:26,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 68 transitions. Stem has 4 letters. Loop has 24 letters. [2020-07-01 13:21:26,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:26,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 391 states and 605 transitions. [2020-07-01 13:21:26,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 326 [2020-07-01 13:21:26,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 391 states to 347 states and 538 transitions. [2020-07-01 13:21:26,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2020-07-01 13:21:26,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-07-01 13:21:26,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 347 states and 538 transitions. [2020-07-01 13:21:26,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:26,522 INFO L688 BuchiCegarLoop]: Abstraction has 347 states and 538 transitions. [2020-07-01 13:21:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states and 538 transitions. [2020-07-01 13:21:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 235. [2020-07-01 13:21:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-07-01 13:21:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 374 transitions. [2020-07-01 13:21:26,539 INFO L711 BuchiCegarLoop]: Abstraction has 235 states and 374 transitions. [2020-07-01 13:21:26,539 INFO L591 BuchiCegarLoop]: Abstraction has 235 states and 374 transitions. [2020-07-01 13:21:26,539 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 13:21:26,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 374 transitions. [2020-07-01 13:21:26,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 214 [2020-07-01 13:21:26,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:26,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:26,542 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:21:26,542 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2020-07-01 13:21:26,543 INFO L794 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1161#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1337#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1349#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1347#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1344#L34-2 [2020-07-01 13:21:26,543 INFO L796 eck$LassoCheckResult]: Loop: 1344#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1376#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1375#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1372#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1374#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1367#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1363#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1343#L34 [77] L34-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (>= v_ULTIMATE.start_main_~i~0_13 (* 2 v_ULTIMATE.start_main_~j~0_13))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1344#L34-2 [2020-07-01 13:21:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash 78350529, now seen corresponding path program 1 times [2020-07-01 13:21:26,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:26,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140699636] [2020-07-01 13:21:26,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:26,554 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:26,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1326554835, now seen corresponding path program 1 times [2020-07-01 13:21:26,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:26,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419464332] [2020-07-01 13:21:26,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:26,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419464332] [2020-07-01 13:21:26,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756562059] [2020-07-01 13:21:26,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:21:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:26,611 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 13:21:26,611 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:26,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:21:26,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-01 13:21:26,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499357493] [2020-07-01 13:21:26,633 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:21:26,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:21:26,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 13:21:26,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:21:26,634 INFO L87 Difference]: Start difference. First operand 235 states and 374 transitions. cyclomatic complexity: 142 Second operand 8 states. [2020-07-01 13:21:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:21:26,672 INFO L93 Difference]: Finished difference Result 152 states and 221 transitions. [2020-07-01 13:21:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 13:21:26,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 221 transitions. [2020-07-01 13:21:26,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 125 [2020-07-01 13:21:26,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 147 states and 214 transitions. [2020-07-01 13:21:26,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2020-07-01 13:21:26,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2020-07-01 13:21:26,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 214 transitions. [2020-07-01 13:21:26,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:26,678 INFO L688 BuchiCegarLoop]: Abstraction has 147 states and 214 transitions. [2020-07-01 13:21:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 214 transitions. [2020-07-01 13:21:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2020-07-01 13:21:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-07-01 13:21:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2020-07-01 13:21:26,686 INFO L711 BuchiCegarLoop]: Abstraction has 143 states and 210 transitions. [2020-07-01 13:21:26,686 INFO L591 BuchiCegarLoop]: Abstraction has 143 states and 210 transitions. [2020-07-01 13:21:26,686 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 13:21:26,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 210 transitions. [2020-07-01 13:21:26,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 121 [2020-07-01 13:21:26,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:26,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:26,688 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:21:26,688 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2, 2, 2, 2, 2, 1] [2020-07-01 13:21:26,689 INFO L794 eck$LassoCheckResult]: Stem: 1582#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1583#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1689#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1687#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1578#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1579#L34-2 [2020-07-01 13:21:26,689 INFO L796 eck$LassoCheckResult]: Loop: 1579#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1695#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1678#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1694#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1692#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1691#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1690#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1677#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1688#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1595#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1587#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1588#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1703#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1702#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1599#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1641#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1661#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1645#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1620#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1579#L34-2 [2020-07-01 13:21:26,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:26,690 INFO L82 PathProgramCache]: Analyzing trace with hash 78350529, now seen corresponding path program 2 times [2020-07-01 13:21:26,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:26,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631093269] [2020-07-01 13:21:26,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:26,699 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:26,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:26,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1464688895, now seen corresponding path program 1 times [2020-07-01 13:21:26,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:26,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331365299] [2020-07-01 13:21:26,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-01 13:21:26,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331365299] [2020-07-01 13:21:26,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:21:26,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:21:26,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755426706] [2020-07-01 13:21:26,730 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:21:26,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:21:26,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:21:26,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:21:26,731 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. cyclomatic complexity: 69 Second operand 4 states. [2020-07-01 13:21:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:21:26,756 INFO L93 Difference]: Finished difference Result 136 states and 191 transitions. [2020-07-01 13:21:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:21:26,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 191 transitions. [2020-07-01 13:21:26,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2020-07-01 13:21:26,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 136 states and 191 transitions. [2020-07-01 13:21:26,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-07-01 13:21:26,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-07-01 13:21:26,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 191 transitions. [2020-07-01 13:21:26,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:26,762 INFO L688 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2020-07-01 13:21:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 191 transitions. [2020-07-01 13:21:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2020-07-01 13:21:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-01 13:21:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 188 transitions. [2020-07-01 13:21:26,767 INFO L711 BuchiCegarLoop]: Abstraction has 133 states and 188 transitions. [2020-07-01 13:21:26,767 INFO L591 BuchiCegarLoop]: Abstraction has 133 states and 188 transitions. [2020-07-01 13:21:26,768 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 13:21:26,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 188 transitions. [2020-07-01 13:21:26,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2020-07-01 13:21:26,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:26,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:26,770 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:21:26,770 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 3, 3, 2, 2, 2] [2020-07-01 13:21:26,770 INFO L794 eck$LassoCheckResult]: Stem: 1868#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1869#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1960#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1966#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1963#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1964#L34-2 [2020-07-01 13:21:26,770 INFO L796 eck$LassoCheckResult]: Loop: 1964#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1880#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1877#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1878#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1981#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1979#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1978#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1977#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1976#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1975#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 1971#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1973#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1972#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1970#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1969#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1968#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1867#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 1959#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1967#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1965#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1964#L34-2 [2020-07-01 13:21:26,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash 78350529, now seen corresponding path program 3 times [2020-07-01 13:21:26,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:26,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711229233] [2020-07-01 13:21:26,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:26,780 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1162764931, now seen corresponding path program 2 times [2020-07-01 13:21:26,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:26,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052272143] [2020-07-01 13:21:26,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:26,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052272143] [2020-07-01 13:21:26,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752724347] [2020-07-01 13:21:26,837 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:21:26,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:21:26,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:21:26,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:26,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:26,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:21:26,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-01 13:21:26,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016622941] [2020-07-01 13:21:26,872 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:21:26,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:21:26,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 13:21:26,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:21:26,873 INFO L87 Difference]: Start difference. First operand 133 states and 188 transitions. cyclomatic complexity: 57 Second operand 8 states. [2020-07-01 13:21:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:21:26,988 INFO L93 Difference]: Finished difference Result 207 states and 279 transitions. [2020-07-01 13:21:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 13:21:26,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 279 transitions. [2020-07-01 13:21:26,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 140 [2020-07-01 13:21:26,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 279 transitions. [2020-07-01 13:21:26,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-07-01 13:21:26,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-07-01 13:21:26,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 279 transitions. [2020-07-01 13:21:26,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:26,994 INFO L688 BuchiCegarLoop]: Abstraction has 207 states and 279 transitions. [2020-07-01 13:21:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 279 transitions. [2020-07-01 13:21:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 149. [2020-07-01 13:21:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-07-01 13:21:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 202 transitions. [2020-07-01 13:21:27,000 INFO L711 BuchiCegarLoop]: Abstraction has 149 states and 202 transitions. [2020-07-01 13:21:27,000 INFO L591 BuchiCegarLoop]: Abstraction has 149 states and 202 transitions. [2020-07-01 13:21:27,000 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-01 13:21:27,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 202 transitions. [2020-07-01 13:21:27,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2020-07-01 13:21:27,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:27,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:27,002 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-07-01 13:21:27,002 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:21:27,002 INFO L794 eck$LassoCheckResult]: Stem: 2278#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 2279#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2379#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2378#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2377#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2286#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2298#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2299#L25 [2020-07-01 13:21:27,003 INFO L796 eck$LassoCheckResult]: Loop: 2299#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2426#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2413#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2410#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2300#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2302#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2415#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2416#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2419#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2280#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2281#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 2299#L25 [2020-07-01 13:21:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2014551182, now seen corresponding path program 1 times [2020-07-01 13:21:27,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:27,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511718211] [2020-07-01 13:21:27,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:27,013 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash 769352497, now seen corresponding path program 2 times [2020-07-01 13:21:27,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:27,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227521745] [2020-07-01 13:21:27,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:27,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227521745] [2020-07-01 13:21:27,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016822197] [2020-07-01 13:21:27,050 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:21:27,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:21:27,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:21:27,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:21:27,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:27,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:21:27,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-01 13:21:27,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440753957] [2020-07-01 13:21:27,079 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:21:27,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:21:27,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:21:27,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:21:27,080 INFO L87 Difference]: Start difference. First operand 149 states and 202 transitions. cyclomatic complexity: 55 Second operand 5 states. [2020-07-01 13:21:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:21:27,120 INFO L93 Difference]: Finished difference Result 192 states and 246 transitions. [2020-07-01 13:21:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:21:27,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 246 transitions. [2020-07-01 13:21:27,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 136 [2020-07-01 13:21:27,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 246 transitions. [2020-07-01 13:21:27,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2020-07-01 13:21:27,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2020-07-01 13:21:27,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 246 transitions. [2020-07-01 13:21:27,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:27,126 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 246 transitions. [2020-07-01 13:21:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 246 transitions. [2020-07-01 13:21:27,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 159. [2020-07-01 13:21:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-01 13:21:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 212 transitions. [2020-07-01 13:21:27,131 INFO L711 BuchiCegarLoop]: Abstraction has 159 states and 212 transitions. [2020-07-01 13:21:27,131 INFO L591 BuchiCegarLoop]: Abstraction has 159 states and 212 transitions. [2020-07-01 13:21:27,131 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-01 13:21:27,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 212 transitions. [2020-07-01 13:21:27,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 133 [2020-07-01 13:21:27,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:27,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:27,133 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-07-01 13:21:27,133 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1, 1] [2020-07-01 13:21:27,133 INFO L794 eck$LassoCheckResult]: Stem: 2667#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 2668#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2665#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2677#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2664#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2666#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2805#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2803#L16 [2020-07-01 13:21:27,134 INFO L796 eck$LassoCheckResult]: Loop: 2803#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2804#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2814#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2813#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2705#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2806#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2807#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2784#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 2810#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2812#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 2803#L16 [2020-07-01 13:21:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2014361716, now seen corresponding path program 1 times [2020-07-01 13:21:27,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:27,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140673520] [2020-07-01 13:21:27,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:27,143 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:27,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1352612346, now seen corresponding path program 1 times [2020-07-01 13:21:27,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:27,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001967009] [2020-07-01 13:21:27,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:27,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:27,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1638900783, now seen corresponding path program 1 times [2020-07-01 13:21:27,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:27,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133050942] [2020-07-01 13:21:27,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 13:21:27,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133050942] [2020-07-01 13:21:27,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124454310] [2020-07-01 13:21:27,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:21:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:27,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:21:27,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 13:21:27,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:21:27,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-01 13:21:27,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194008075] [2020-07-01 13:21:27,308 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:27,308 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:27,309 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:27,309 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:27,309 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:21:27,309 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:27,309 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:27,309 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:27,309 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-07-01 13:21:27,309 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:27,309 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:27,311 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 13:21:27,321 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 13:21:27,324 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 13:21:27,366 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:27,366 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:27,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:27,371 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:27,407 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:21:27,407 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:27,413 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 13:21:27,442 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:27,442 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:27,443 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:27,443 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:27,443 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:21:27,443 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:27,443 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:27,443 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:27,443 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-07-01 13:21:27,443 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:27,443 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:27,445 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 13:21:27,456 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 13:21:27,460 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 13:21:27,507 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:27,507 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:27,513 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 13:21:27,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:21:27,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:21:27,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:21:27,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:21:27,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:21:27,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:21:27,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:21:27,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:21:27,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:21:27,525 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:27,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:21:27,530 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:21:27,530 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:21:27,530 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-07-01 13:21:27,560 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:21:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:27,577 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 13:21:27,577 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:27,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 13:21:27,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:27,632 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 13:21:27,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:27,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 13:21:27,655 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:27,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 13:21:27,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:27,752 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 13:21:27,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:27,817 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 13:21:27,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:27,830 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-07-01 13:21:27,830 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 9 loop predicates [2020-07-01 13:21:27,830 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 159 states and 212 transitions. cyclomatic complexity: 56 Second operand 5 states. [2020-07-01 13:21:28,058 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 159 states and 212 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 876 states and 1126 transitions. Complement of second has 46 states. [2020-07-01 13:21:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 7 non-accepting loop states 3 accepting loop states [2020-07-01 13:21:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 13:21:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2020-07-01 13:21:28,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 7 letters. Loop has 10 letters. [2020-07-01 13:21:28,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:28,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 17 letters. Loop has 10 letters. [2020-07-01 13:21:28,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:28,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 7 letters. Loop has 20 letters. [2020-07-01 13:21:28,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:28,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 876 states and 1126 transitions. [2020-07-01 13:21:28,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 284 [2020-07-01 13:21:28,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 876 states to 377 states and 474 transitions. [2020-07-01 13:21:28,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-07-01 13:21:28,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2020-07-01 13:21:28,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 474 transitions. [2020-07-01 13:21:28,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:28,074 INFO L688 BuchiCegarLoop]: Abstraction has 377 states and 474 transitions. [2020-07-01 13:21:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 474 transitions. [2020-07-01 13:21:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 253. [2020-07-01 13:21:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-07-01 13:21:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 333 transitions. [2020-07-01 13:21:28,081 INFO L711 BuchiCegarLoop]: Abstraction has 253 states and 333 transitions. [2020-07-01 13:21:28,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:21:28,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 13:21:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-01 13:21:28,082 INFO L87 Difference]: Start difference. First operand 253 states and 333 transitions. Second operand 9 states. [2020-07-01 13:21:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:21:28,188 INFO L93 Difference]: Finished difference Result 284 states and 368 transitions. [2020-07-01 13:21:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 13:21:28,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 368 transitions. [2020-07-01 13:21:28,192 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 213 [2020-07-01 13:21:28,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 284 states and 368 transitions. [2020-07-01 13:21:28,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-07-01 13:21:28,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-07-01 13:21:28,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 368 transitions. [2020-07-01 13:21:28,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:28,194 INFO L688 BuchiCegarLoop]: Abstraction has 284 states and 368 transitions. [2020-07-01 13:21:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 368 transitions. [2020-07-01 13:21:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 259. [2020-07-01 13:21:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2020-07-01 13:21:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 343 transitions. [2020-07-01 13:21:28,200 INFO L711 BuchiCegarLoop]: Abstraction has 259 states and 343 transitions. [2020-07-01 13:21:28,201 INFO L591 BuchiCegarLoop]: Abstraction has 259 states and 343 transitions. [2020-07-01 13:21:28,201 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-01 13:21:28,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 343 transitions. [2020-07-01 13:21:28,202 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 203 [2020-07-01 13:21:28,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:28,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:28,203 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-07-01 13:21:28,203 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-07-01 13:21:28,204 INFO L794 eck$LassoCheckResult]: Stem: 4565#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 4566#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4622#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4621#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4619#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4600#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4625#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 4588#L25 [2020-07-01 13:21:28,204 INFO L796 eck$LassoCheckResult]: Loop: 4588#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4589#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4601#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4626#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 4634#L25 [78] L25-->L34: Formula: (and (>= v_ULTIMATE.start_main_~j~0_9 0) (= v_ULTIMATE.start_main_~i~0_8 (+ v_ULTIMATE.start_main_~i~0_9 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4581#L34 [63] L34-->L34-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 (* 2 v_ULTIMATE.start_main_~j~0_11)) (= v_ULTIMATE.start_main_~j~0_10 (+ v_ULTIMATE.start_main_~j~0_11 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4582#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4686#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4685#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4595#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 4593#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 4594#L12 [72] L12-->L25: Formula: (> v_ULTIMATE.start_main_~j~0_22 v_ULTIMATE.start_main_~i~0_19) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_22, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_19} AuxVars[] AssignedVars[] 4588#L25 [2020-07-01 13:21:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2014551182, now seen corresponding path program 2 times [2020-07-01 13:21:28,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:28,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373307295] [2020-07-01 13:21:28,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:28,213 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:28,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash 645749555, now seen corresponding path program 3 times [2020-07-01 13:21:28,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:28,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668351525] [2020-07-01 13:21:28,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:28,224 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:28,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:28,224 INFO L82 PathProgramCache]: Analyzing trace with hash 532880676, now seen corresponding path program 2 times [2020-07-01 13:21:28,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:28,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584262485] [2020-07-01 13:21:28,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 13:21:28,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584262485] [2020-07-01 13:21:28,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088109181] [2020-07-01 13:21:28,261 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:21:28,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:21:28,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:21:28,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:21:28,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 13:21:28,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:21:28,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2020-07-01 13:21:28,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162172004] [2020-07-01 13:21:28,378 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:28,378 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:28,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:28,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:28,379 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:21:28,379 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:28,379 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:28,379 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:28,379 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2020-07-01 13:21:28,379 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:28,379 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:28,381 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 13:21:28,384 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 13:21:28,387 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 13:21:28,455 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:28,455 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:28,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:28,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:28,470 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:28,470 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:28,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:28,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:28,508 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:28,508 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:28,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:28,542 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:28,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:21:28,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:28,730 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 13:21:28,733 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:28,733 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:28,733 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:28,733 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:28,733 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:21:28,734 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:28,734 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:28,734 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:28,734 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2020-07-01 13:21:28,734 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:28,734 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:28,736 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 13:21:28,742 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 13:21:28,745 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 13:21:28,802 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:28,802 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:28,806 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 13:21:28,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:21:28,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:21:28,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:21:28,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:21:28,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:21:28,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:21:28,814 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:28,847 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 13:21:28,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:21:28,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:21:28,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:21:28,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:21:28,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:21:28,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:21:28,855 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:28,888 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 13:21:28,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:21:28,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:21:28,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:21:28,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:21:28,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:21:28,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:21:28,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:21:28,895 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:21:28,899 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:21:28,899 INFO L444 ModelExtractionUtils]: 1 out of 4 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:21:28,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:21:28,902 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:21:28,902 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:21:28,903 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2020-07-01 13:21:28,932 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:21:28,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:28,948 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 13:21:28,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:28,955 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 13:21:28,956 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:29,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 13:21:29,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:29,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 13:21:29,133 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:29,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:21:29,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:29,193 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:21:29,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:29,316 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:21:29,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:29,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:21:29,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:29,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 13:21:29,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:29,542 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:29,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:29,728 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:21:29,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:29,746 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 17 predicates after loop cannibalization [2020-07-01 13:21:29,746 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 17 loop predicates [2020-07-01 13:21:29,746 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 259 states and 343 transitions. cyclomatic complexity: 89 Second operand 7 states. [2020-07-01 13:21:31,794 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 259 states and 343 transitions. cyclomatic complexity: 89. Second operand 7 states. Result 5540 states and 6832 transitions. Complement of second has 303 states. [2020-07-01 13:21:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 31 states 1 stem states 26 non-accepting loop states 3 accepting loop states [2020-07-01 13:21:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 13:21:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 82 transitions. [2020-07-01 13:21:31,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 82 transitions. Stem has 7 letters. Loop has 12 letters. [2020-07-01 13:21:31,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:31,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 82 transitions. Stem has 19 letters. Loop has 12 letters. [2020-07-01 13:21:31,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:31,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 82 transitions. Stem has 7 letters. Loop has 24 letters. [2020-07-01 13:21:31,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:21:31,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5540 states and 6832 transitions. [2020-07-01 13:21:31,862 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 118 [2020-07-01 13:21:31,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5540 states to 1333 states and 1661 transitions. [2020-07-01 13:21:31,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2020-07-01 13:21:31,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2020-07-01 13:21:31,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1333 states and 1661 transitions. [2020-07-01 13:21:31,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:31,872 INFO L688 BuchiCegarLoop]: Abstraction has 1333 states and 1661 transitions. [2020-07-01 13:21:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states and 1661 transitions. [2020-07-01 13:21:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 552. [2020-07-01 13:21:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-07-01 13:21:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 791 transitions. [2020-07-01 13:21:31,889 INFO L711 BuchiCegarLoop]: Abstraction has 552 states and 791 transitions. [2020-07-01 13:21:31,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:21:31,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:21:31,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:21:31,889 INFO L87 Difference]: Start difference. First operand 552 states and 791 transitions. Second operand 6 states. [2020-07-01 13:21:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:21:31,927 INFO L93 Difference]: Finished difference Result 408 states and 559 transitions. [2020-07-01 13:21:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 13:21:31,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 559 transitions. [2020-07-01 13:21:31,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 100 [2020-07-01 13:21:31,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 408 states and 559 transitions. [2020-07-01 13:21:31,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2020-07-01 13:21:31,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2020-07-01 13:21:31,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 559 transitions. [2020-07-01 13:21:31,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:31,936 INFO L688 BuchiCegarLoop]: Abstraction has 408 states and 559 transitions. [2020-07-01 13:21:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 559 transitions. [2020-07-01 13:21:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 390. [2020-07-01 13:21:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-07-01 13:21:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 541 transitions. [2020-07-01 13:21:31,944 INFO L711 BuchiCegarLoop]: Abstraction has 390 states and 541 transitions. [2020-07-01 13:21:31,944 INFO L591 BuchiCegarLoop]: Abstraction has 390 states and 541 transitions. [2020-07-01 13:21:31,944 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-01 13:21:31,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 390 states and 541 transitions. [2020-07-01 13:21:31,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 98 [2020-07-01 13:21:31,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:31,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:31,947 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-01 13:21:31,948 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-07-01 13:21:31,948 INFO L794 eck$LassoCheckResult]: Stem: 12147#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 12148#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 12193#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12305#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 12301#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 12302#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12295#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 12296#L16 [75] L16-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1)) (>= (+ v_ULTIMATE.start_main_~j~0_19 2) v_ULTIMATE.start_main_~i~0_18)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 12253#L34-2 [2020-07-01 13:21:31,948 INFO L796 eck$LassoCheckResult]: Loop: 12253#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 12249#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12250#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 12238#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 12239#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12299#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 12300#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12253#L34-2 [2020-07-01 13:21:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1979296319, now seen corresponding path program 1 times [2020-07-01 13:21:31,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:31,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544393799] [2020-07-01 13:21:31,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:31,958 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash 802769598, now seen corresponding path program 2 times [2020-07-01 13:21:31,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:31,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470500669] [2020-07-01 13:21:31,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:31,967 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:31,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:31,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1880440512, now seen corresponding path program 1 times [2020-07-01 13:21:31,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:31,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795384659] [2020-07-01 13:21:31,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:32,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795384659] [2020-07-01 13:21:32,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506819528] [2020-07-01 13:21:32,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:21:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:21:32,027 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 13:21:32,027 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:21:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:21:32,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:21:32,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 13:21:32,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644497835] [2020-07-01 13:21:32,087 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:32,087 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:32,087 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:32,087 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:32,087 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:21:32,087 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,087 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:32,088 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:32,088 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop [2020-07-01 13:21:32,088 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:32,088 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:32,089 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 13:21:32,092 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 13:21:32,096 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 13:21:32,168 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:32,168 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:32,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:32,180 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:32,181 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:32,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:32,220 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:32,220 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:32,256 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:21:32,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:32,351 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:32,351 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=5, ULTIMATE.start_main_~i~0=6} Honda state: {ULTIMATE.start_main_~j~0=5, ULTIMATE.start_main_~i~0=6} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=3}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}] Lambdas: [1, 0, 4] Nus: [0, 1] [2020-07-01 13:21:32,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:21:32,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:21:32,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:21:32,383 INFO L87 Difference]: Start difference. First operand 390 states and 541 transitions. cyclomatic complexity: 157 Second operand 5 states. [2020-07-01 13:21:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:21:32,417 INFO L93 Difference]: Finished difference Result 363 states and 447 transitions. [2020-07-01 13:21:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:21:32,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 447 transitions. [2020-07-01 13:21:32,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2020-07-01 13:21:32,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 135 states and 159 transitions. [2020-07-01 13:21:32,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-07-01 13:21:32,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-07-01 13:21:32,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 159 transitions. [2020-07-01 13:21:32,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 13:21:32,424 INFO L688 BuchiCegarLoop]: Abstraction has 135 states and 159 transitions. [2020-07-01 13:21:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 159 transitions. [2020-07-01 13:21:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2020-07-01 13:21:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-01 13:21:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2020-07-01 13:21:32,426 INFO L711 BuchiCegarLoop]: Abstraction has 95 states and 115 transitions. [2020-07-01 13:21:32,426 INFO L591 BuchiCegarLoop]: Abstraction has 95 states and 115 transitions. [2020-07-01 13:21:32,426 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-01 13:21:32,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 115 transitions. [2020-07-01 13:21:32,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 13:21:32,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:21:32,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:21:32,428 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1] [2020-07-01 13:21:32,428 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-07-01 13:21:32,428 INFO L794 eck$LassoCheckResult]: Stem: 12960#ULTIMATE.startENTRY [52] ULTIMATE.startENTRY-->L34-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~j~0_1 v_ULTIMATE.start_main_~i~0_1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 12961#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 12990#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 13043#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 13042#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 12955#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 13046#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 13045#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 12953#L12 [2020-07-01 13:21:32,429 INFO L796 eck$LassoCheckResult]: Loop: 12953#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12962#L14 [66] L14-->L16: Formula: (and (= v_ULTIMATE.start_main_~j~0_15 (+ v_ULTIMATE.start_main_~j~0_16 1)) (< v_ULTIMATE.start_main_~j~0_16 5)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 13034#L16 [56] L16-->L34-2: Formula: (and (< (+ v_ULTIMATE.start_main_~j~0_17 2) v_ULTIMATE.start_main_~i~0_17) (= v_ULTIMATE.start_main_~i~0_16 (+ v_ULTIMATE.start_main_~i~0_17 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_17, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 13035#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 13044#L12 [60] L12-->L14: Formula: (and (<= v_ULTIMATE.start_main_~j~0_14 v_ULTIMATE.start_main_~i~0_15) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12968#L14 [73] L14-->L34-2: Formula: (and (>= v_ULTIMATE.start_main_~j~0_21 5) (= v_ULTIMATE.start_main_~j~0_20 (+ v_ULTIMATE.start_main_~j~0_21 (- 1)))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 12952#L34-2 [55] L34-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 12953#L12 [2020-07-01 13:21:32,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:32,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1979296516, now seen corresponding path program 2 times [2020-07-01 13:21:32,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:32,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756252664] [2020-07-01 13:21:32,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:32,437 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:32,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:32,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1101395972, now seen corresponding path program 3 times [2020-07-01 13:21:32,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:32,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693984281] [2020-07-01 13:21:32,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:32,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:21:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1915319201, now seen corresponding path program 2 times [2020-07-01 13:21:32,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:21:32,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187877887] [2020-07-01 13:21:32,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:21:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:21:32,456 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:21:32,510 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:32,510 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:32,510 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:32,510 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:32,510 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:21:32,510 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,510 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:32,511 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:32,511 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Loop [2020-07-01 13:21:32,511 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:32,511 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:32,512 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 13:21:32,523 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 13:21:32,526 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 13:21:32,580 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:32,580 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:32,584 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:21:32,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:32,646 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:32,647 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=4, ULTIMATE.start_main_~i~0=7} Honda state: {ULTIMATE.start_main_~j~0=4, ULTIMATE.start_main_~i~0=7} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=2}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=1}] Lambdas: [1, 13, 1] Nus: [1, 0] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:32,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:32,684 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:32,684 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_10=0} Honda state: {v_rep~unnamed0~0~false_10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:32,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:32,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:32,720 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_10=1} Honda state: {v_rep~unnamed0~0~true_10=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-07-01 13:21:32,787 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:21:32,787 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:21:32,787 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:21:32,787 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:21:32,787 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:21:32,787 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,787 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:21:32,788 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:21:32,788 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso [2020-07-01 13:21:32,788 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:21:32,788 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:21:32,789 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 13:21:32,791 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 13:21:32,794 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 13:21:32,796 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 13:21:32,798 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 13:21:32,870 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:21:32,870 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:32,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:32,877 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:32,877 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:32,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:32,914 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:32,914 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:32,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:32,951 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:32,951 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:32,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:32,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:32,987 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:32,987 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:33,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:21:33,021 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:21:33,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:21:33,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:21:33,082 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 13:21:33,082 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=0} Honda state: {ULTIMATE.start_main_~j~0=4, ULTIMATE.start_main_~i~0=8} Generalized eigenvectors: [{ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=1}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=1}, {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~i~0=1}] Lambdas: [0, 1, 1] Nus: [1, 0] [2020-07-01 13:21:33,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-07-01 13:21:33,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-07-01 13:21:33,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-07-01 13:21:33,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-07-01 13:21:33,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-07-01 13:21:33,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-07-01 13:21:33,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:21:33 BasicIcfg [2020-07-01 13:21:33,132 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 13:21:33,135 INFO L168 Benchmark]: Toolchain (without parser) took 10351.25 ms. Allocated memory was 649.6 MB in the beginning and 845.7 MB in the end (delta: 196.1 MB). Free memory was 561.5 MB in the beginning and 607.8 MB in the end (delta: -46.3 MB). Peak memory consumption was 149.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:21:33,135 INFO L168 Benchmark]: CDTParser took 0.18 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 13:21:33,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.31 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 561.5 MB in the beginning and 648.0 MB in the end (delta: -86.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:21:33,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.88 ms. Allocated memory is still 685.2 MB. Free memory was 648.0 MB in the beginning and 645.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:21:33,136 INFO L168 Benchmark]: Boogie Preprocessor took 20.59 ms. Allocated memory is still 685.2 MB. Free memory was 645.9 MB in the beginning and 644.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:21:33,136 INFO L168 Benchmark]: RCFGBuilder took 259.18 ms. Allocated memory is still 685.2 MB. Free memory was 644.8 MB in the beginning and 629.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:21:33,137 INFO L168 Benchmark]: BlockEncodingV2 took 83.30 ms. Allocated memory is still 685.2 MB. Free memory was 629.2 MB in the beginning and 623.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:21:33,137 INFO L168 Benchmark]: TraceAbstraction took 153.06 ms. Allocated memory is still 685.2 MB. Free memory was 622.7 MB in the beginning and 614.0 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:21:33,138 INFO L168 Benchmark]: BuchiAutomizer took 9485.74 ms. Allocated memory was 685.2 MB in the beginning and 845.7 MB in the end (delta: 160.4 MB). Free memory was 614.0 MB in the beginning and 607.8 MB in the end (delta: 6.1 MB). Peak memory consumption was 166.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:21:33,140 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 19 edges - StatisticsResult: Encoded RCFG 8 locations, 15 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 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 307.31 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 561.5 MB in the beginning and 648.0 MB in the end (delta: -86.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.88 ms. Allocated memory is still 685.2 MB. Free memory was 648.0 MB in the beginning and 645.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.59 ms. Allocated memory is still 685.2 MB. Free memory was 645.9 MB in the beginning and 644.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 259.18 ms. Allocated memory is still 685.2 MB. Free memory was 644.8 MB in the beginning and 629.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 83.30 ms. Allocated memory is still 685.2 MB. Free memory was 629.2 MB in the beginning and 623.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 153.06 ms. Allocated memory is still 685.2 MB. Free memory was 622.7 MB in the beginning and 614.0 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 9485.74 ms. Allocated memory was 685.2 MB in the beginning and 845.7 MB in the end (delta: 160.4 MB). Free memory was 614.0 MB in the beginning and 607.8 MB in the end (delta: 6.1 MB). Peak memory consumption was 166.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false * 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: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 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=8occurred 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (10 trivial, 0 deterministic, 4 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function j and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 7 and consists of 8 locations. One nondeterministic module has affine ranking function j and consists of 12 locations. One nondeterministic module has affine ranking function -2 * i + 7 and consists of 31 locations. 10 modules have a trivial ranking function, the largest among these consists of 9 locations. The remainder module has 95 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 13 iterations. TraceHistogramMax:5. Analysis of lassos took 4.2s. Construction of modules took 0.8s. Büchi inclusion checks took 3.9s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1210 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 390 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 23/25 HoareTripleCheckerStatistics: 72 SDtfs, 194 SDslu, 63 SDs, 0 SdLazy, 1099 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT2 conc1 concLT2 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax152 hnf100 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp92 dnf100 smp100 tf106 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 12]: Nontermination argument in form of an infinite program execution. [2020-07-01 13:21:33,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-07-01 13:21:33,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-07-01 13:21:33,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-07-01 13:21:33,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-07-01 13:21:33,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-07-01 13:21:33,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-07-01 13:21:33,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-07-01 13:21:33,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-07-01 13:21:33,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-07-01 13:21:33,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false [2020-07-01 13:21:33,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true [2020-07-01 13:21:33,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false Nontermination argument in form of an infinite execution State at position 0 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@367930cb=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=0, j=0} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@367930cb=0, ~unnamed0~0~true=1, \result=0, ~unnamed0~0~false=0, i=8, j=4} For i>1, the state at position i is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@367930cb=0 + sum_{k=0}^i 0, ~unnamed0~0~true=1 + sum_{k=0}^i 0, \result=0 + sum_{k=0}^i 0, ~unnamed0~0~false=0 + sum_{k=0}^i 0, i=8 + sum_{k=0}^i 1*0^k + 1 + 1*k*0^(k-1) + 1, j=4 + sum_{k=0}^i 0} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 3GEVs Lambdas: [0, 1, 1] Mus: [1, 0] - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] i = __VERIFIER_nondet_int() [L9] j = i [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND FALSE !(j < 5) [L22] j = j-1 [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND FALSE !(j < 5) [L22] j = j-1 [L11] COND TRUE i > 0 Loop: [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND TRUE j < 5 [L15] j = j+1 [L16] COND TRUE i-j>2 [L17] i = i+1 [L11] COND TRUE i > 0 [L12] COND TRUE i >= j [L13] i = i+1 [L14] COND FALSE !(j < 5) [L22] j = j-1 [L11] COND TRUE i > 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-07-01 13:21:19.498 ----------------------------------------------- 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_2Ev9fp/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:21:34.581 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check