/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:13:51,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:13:51,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:13:51,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:13:51,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:13:51,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:13:51,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:13:51,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:13:51,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:13:51,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:13:51,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:13:51,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:13:51,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:13:51,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:13:51,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:13:51,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:13:51,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:13:51,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:13:51,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:13:51,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:13:51,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:13:51,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:13:51,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:13:51,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:13:51,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:13:51,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:13:51,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:13:51,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:13:51,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:13:51,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:13:51,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:13:51,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:13:51,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:13:51,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:13:51,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:13:51,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:13:51,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:13:51,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:13:51,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:13:51,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:13:51,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:13:51,775 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:13:51,789 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:13:51,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:13:51,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:13:51,791 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:13:51,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:13:51,791 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:13:51,791 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:13:51,792 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:13:51,792 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:13:51,792 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:13:51,792 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:13:51,792 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:13:51,793 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:13:51,793 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:13:51,793 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:51,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:13:51,793 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:13:51,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:13:51,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:13:51,794 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:13:51,794 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:13:51,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:13:51,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:13:51,795 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:13:51,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:13:51,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:13:51,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:13:51,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:13:51,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:13:51,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:13:51,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:13:51,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:13:51,981 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:13:51,982 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:13:51,982 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:13:52,047 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_PSiMzm/tmp/3b7d8169988a45d299963c9a807e0982/FLAG106348677 [2020-07-01 11:13:52,384 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:13:52,385 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:13:52,391 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_PSiMzm/tmp/3b7d8169988a45d299963c9a807e0982/FLAG106348677 [2020-07-01 11:13:52,794 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_PSiMzm/tmp/3b7d8169988a45d299963c9a807e0982 [2020-07-01 11:13:52,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:13:52,807 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:13:52,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:13:52,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:13:52,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:13:52,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:13:52" (1/1) ... [2020-07-01 11:13:52,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679f2031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:52, skipping insertion in model container [2020-07-01 11:13:52,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:13:52" (1/1) ... [2020-07-01 11:13:52,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:13:52,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:13:53,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:13:53,075 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:13:53,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:13:53,106 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:13:53,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53 WrapperNode [2020-07-01 11:13:53,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:13:53,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:13:53,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:13:53,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:13:53,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (1/1) ... [2020-07-01 11:13:53,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (1/1) ... [2020-07-01 11:13:53,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:13:53,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:13:53,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:13:53,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:13:53,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (1/1) ... [2020-07-01 11:13:53,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (1/1) ... [2020-07-01 11:13:53,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (1/1) ... [2020-07-01 11:13:53,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (1/1) ... [2020-07-01 11:13:53,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (1/1) ... [2020-07-01 11:13:53,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (1/1) ... [2020-07-01 11:13:53,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (1/1) ... [2020-07-01 11:13:53,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:13:53,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:13:53,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:13:53,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:13:53,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:13:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:13:53,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:13:53,394 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:13:53,394 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 11:13:53,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:13:53 BoogieIcfgContainer [2020-07-01 11:13:53,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:13:53,399 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:13:53,399 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:13:53,401 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:13:53,402 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:13:53" (1/1) ... [2020-07-01 11:13:53,414 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges [2020-07-01 11:13:53,415 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:13:53,416 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:13:53,417 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:13:53,417 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:13:53,419 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:13:53,420 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:13:53,420 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:13:53,435 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:13:53,451 INFO L200 BlockEncoder]: SBE split 3 edges [2020-07-01 11:13:53,455 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 11:13:53,457 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:13:53,470 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 11:13:53,472 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 11:13:53,473 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:13:53,473 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:13:53,473 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:13:53,474 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:13:53,474 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges [2020-07-01 11:13:53,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:13:53 BasicIcfg [2020-07-01 11:13:53,475 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:13:53,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:13:53,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:13:53,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:13:53,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:13:52" (1/4) ... [2020-07-01 11:13:53,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69380d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:13:53, skipping insertion in model container [2020-07-01 11:13:53,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (2/4) ... [2020-07-01 11:13:53,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69380d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:13:53, skipping insertion in model container [2020-07-01 11:13:53,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:13:53" (3/4) ... [2020-07-01 11:13:53,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69380d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:13:53, skipping insertion in model container [2020-07-01 11:13:53,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:13:53" (4/4) ... [2020-07-01 11:13:53,484 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:13:53,494 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:13:53,501 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 11:13:53,516 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 11:13:53,539 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:13:53,539 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:13:53,539 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:13:53,539 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:13:53,539 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:13:53,540 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:13:53,540 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:13:53,540 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:13:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-07-01 11:13:53,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:13:53,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-07-01 11:13:53,614 INFO L271 CegarLoopResult]: At program point L18-1(lines 11 23) the Hoare annotation is: true [2020-07-01 11:13:53,614 INFO L268 CegarLoopResult]: For program point L15-1(lines 11 23) no Hoare annotation was computed. [2020-07-01 11:13:53,614 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:13:53,615 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:13:53,615 INFO L268 CegarLoopResult]: For program point L12-2(lines 11 23) no Hoare annotation was computed. [2020-07-01 11:13:53,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:13:53 BasicIcfg [2020-07-01 11:13:53,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:13:53,624 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:13:53,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:13:53,627 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:13:53,628 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:13:53,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:13:52" (1/5) ... [2020-07-01 11:13:53,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@236e2c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:13:53, skipping insertion in model container [2020-07-01 11:13:53,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:13:53,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:13:53" (2/5) ... [2020-07-01 11:13:53,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@236e2c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:13:53, skipping insertion in model container [2020-07-01 11:13:53,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:13:53,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:13:53" (3/5) ... [2020-07-01 11:13:53,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@236e2c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:13:53, skipping insertion in model container [2020-07-01 11:13:53,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:13:53,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:13:53" (4/5) ... [2020-07-01 11:13:53,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@236e2c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:13:53, skipping insertion in model container [2020-07-01 11:13:53,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:13:53,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:13:53" (5/5) ... [2020-07-01 11:13:53,633 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:13:53,662 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:13:53,662 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:13:53,662 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:13:53,662 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:13:53,663 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:13:53,663 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:13:53,663 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:13:53,663 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:13:53,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-01 11:13:53,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 11:13:53,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:53,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:53,690 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:13:53,690 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:13:53,691 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:13:53,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-01 11:13:53,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 11:13:53,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:53,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:53,692 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 11:13:53,692 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:13:53,697 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5#L18-1true [2020-07-01 11:13:53,698 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6#L12true [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3#L12-2true [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 7#L15-1true [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L18-1true [2020-07-01 11:13:53,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2020-07-01 11:13:53,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:53,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803761474] [2020-07-01 11:13:53,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:53,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2197058, now seen corresponding path program 1 times [2020-07-01 11:13:53,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:53,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672602554] [2020-07-01 11:13:53,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:53,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash 64996486, now seen corresponding path program 1 times [2020-07-01 11:13:53,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:53,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141735727] [2020-07-01 11:13:53,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:53,827 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:53,882 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:13:53,882 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:13:53,883 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:13:53,883 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:13:53,883 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:13:53,883 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:53,883 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:13:53,883 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:13:53,884 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:13:53,884 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:13:53,884 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:13:53,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:53,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:53,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:53,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:54,023 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:13:54,024 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:54,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:13:54,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:13:54,045 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:13:54,045 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:54,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:13:54,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:13:54,086 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:13:54,086 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:54,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:13:54,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:13:54,126 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:13:54,127 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:54,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:13:54,161 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:54,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:13:54,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:13:54,206 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:13:54,235 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:13:54,236 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:13:54,236 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:13:54,236 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:13:54,236 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:13:54,236 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:54,236 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:13:54,237 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:13:54,237 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 11:13:54,237 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:13:54,237 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:13:54,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 11:13:54,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:54,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:54,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:54,335 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:13:54,341 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:54,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:13:54,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:13:54,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:13:54,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:13:54,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:13:54,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:13:54,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:13:54,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:54,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:13:54,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:13:54,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:13:54,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:13:54,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:13:54,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:13:54,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:13:54,426 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:54,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:13:54,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:13:54,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:13:54,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:13:54,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:13:54,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:13:54,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:13:54,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:13:54,467 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 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:54,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:13:54,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:13:54,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:13:54,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:13:54,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:13:54,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:13:54,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:13:54,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:13:54,511 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:13:54,515 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 11:13:54,515 INFO L444 ModelExtractionUtils]: 1 out of 3 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:54,521 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:13:54,521 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:13:54,522 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:13:54,522 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-01 11:13:54,556 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:13:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:54,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:54,598 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:54,610 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:13:54,611 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:54,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:13:54,662 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:54,719 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:13:54,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:54,722 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 11:13:54,728 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 4 loop predicates [2020-07-01 11:13:54,729 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 4 states. [2020-07-01 11:13:54,956 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 4 states. Result 43 states and 100 transitions. Complement of second has 13 states. [2020-07-01 11:13:54,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-01 11:13:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 11:13:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2020-07-01 11:13:54,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 60 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-01 11:13:54,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:54,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 60 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-01 11:13:54,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:54,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 60 transitions. Stem has 1 letters. Loop has 8 letters. [2020-07-01 11:13:54,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:54,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 100 transitions. [2020-07-01 11:13:54,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-01 11:13:54,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 81 transitions. [2020-07-01 11:13:54,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-01 11:13:54,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-07-01 11:13:54,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 81 transitions. [2020-07-01 11:13:54,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:54,984 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 81 transitions. [2020-07-01 11:13:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 81 transitions. [2020-07-01 11:13:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2020-07-01 11:13:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 11:13:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 71 transitions. [2020-07-01 11:13:55,018 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 71 transitions. [2020-07-01 11:13:55,018 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 71 transitions. [2020-07-01 11:13:55,018 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 11:13:55,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 71 transitions. [2020-07-01 11:13:55,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-01 11:13:55,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:55,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:55,021 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 11:13:55,021 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:13:55,021 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 129#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 134#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 122#L12-2 [56] L12-2-->L15-1: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 123#L15-1 [2020-07-01 11:13:55,022 INFO L796 eck$LassoCheckResult]: Loop: 123#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 130#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 131#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 150#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 123#L15-1 [2020-07-01 11:13:55,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:55,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2096338, now seen corresponding path program 1 times [2020-07-01 11:13:55,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:55,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104503938] [2020-07-01 11:13:55,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:55,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104503938] [2020-07-01 11:13:55,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:13:55,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:13:55,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289910717] [2020-07-01 11:13:55,064 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 11:13:55,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:55,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2305196, now seen corresponding path program 1 times [2020-07-01 11:13:55,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:55,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236099859] [2020-07-01 11:13:55,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:55,076 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:55,107 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:13:55,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:13:55,108 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:13:55,108 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:13:55,108 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:13:55,108 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:55,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:13:55,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:13:55,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:13:55,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:13:55,109 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:13:55,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:55,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:55,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:55,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:55,196 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:13:55,196 INFO L404 LassoAnalysis]: Checking for nontermination... 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 11:13:55,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:13:55,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:13:55,206 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:13:55,206 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 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 11:13:55,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:13:55,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:13:55,247 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:13:55,247 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 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:55,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:13:55,283 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:55,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:13:55,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:13:55,449 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:13:55,451 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:13:55,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:13:55,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:13:55,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:13:55,452 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:13:55,452 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:55,452 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:13:55,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:13:55,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 11:13:55,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:13:55,452 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:13:55,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:55,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 11:13:55,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:55,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:55,538 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:13:55,538 INFO L489 LassoAnalysis]: Using template 'affine'. 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 11:13:55,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:13:55,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:13:55,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:13:55,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:13:55,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:13:55,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:13:55,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:13:55,551 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 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 11:13:55,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:13:55,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:13:55,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:13:55,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:13:55,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:13:55,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:13:55,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:13:55,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:13:55,591 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:13:55,595 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:13:55,595 INFO L444 ModelExtractionUtils]: 0 out of 3 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 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:55,599 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:13:55,599 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:13:55,599 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:13:55,599 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2020-07-01 11:13:55,629 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:13:55,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:55,654 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:55,654 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:55,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:13:55,662 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:55,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:55,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:55,695 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:55,695 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:55,697 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-07-01 11:13:55,698 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 5 loop predicates [2020-07-01 11:13:55,698 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 71 transitions. cyclomatic complexity: 44 Second operand 3 states. [2020-07-01 11:13:55,936 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 71 transitions. cyclomatic complexity: 44. Second operand 3 states. Result 883 states and 1895 transitions. Complement of second has 107 states. [2020-07-01 11:13:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-07-01 11:13:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 11:13:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2020-07-01 11:13:55,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 81 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-01 11:13:55,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:55,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 81 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-01 11:13:55,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:55,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 81 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-01 11:13:55,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:55,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 1895 transitions. [2020-07-01 11:13:55,967 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 76 [2020-07-01 11:13:55,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 193 states and 383 transitions. [2020-07-01 11:13:55,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2020-07-01 11:13:55,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-07-01 11:13:55,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 383 transitions. [2020-07-01 11:13:55,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:55,972 INFO L688 BuchiCegarLoop]: Abstraction has 193 states and 383 transitions. [2020-07-01 11:13:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 383 transitions. [2020-07-01 11:13:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 119. [2020-07-01 11:13:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-01 11:13:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 253 transitions. [2020-07-01 11:13:55,985 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 253 transitions. [2020-07-01 11:13:55,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:55,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:13:55,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:13:55,990 INFO L87 Difference]: Start difference. First operand 119 states and 253 transitions. Second operand 3 states. [2020-07-01 11:13:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:56,032 INFO L93 Difference]: Finished difference Result 150 states and 291 transitions. [2020-07-01 11:13:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:13:56,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 291 transitions. [2020-07-01 11:13:56,036 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 63 [2020-07-01 11:13:56,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 291 transitions. [2020-07-01 11:13:56,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2020-07-01 11:13:56,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-07-01 11:13:56,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 291 transitions. [2020-07-01 11:13:56,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:56,039 INFO L688 BuchiCegarLoop]: Abstraction has 150 states and 291 transitions. [2020-07-01 11:13:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 291 transitions. [2020-07-01 11:13:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2020-07-01 11:13:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-07-01 11:13:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 288 transitions. [2020-07-01 11:13:56,049 INFO L711 BuchiCegarLoop]: Abstraction has 147 states and 288 transitions. [2020-07-01 11:13:56,049 INFO L591 BuchiCegarLoop]: Abstraction has 147 states and 288 transitions. [2020-07-01 11:13:56,049 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 11:13:56,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 288 transitions. [2020-07-01 11:13:56,051 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 62 [2020-07-01 11:13:56,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:56,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:56,051 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 11:13:56,051 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:13:56,052 INFO L794 eck$LassoCheckResult]: Stem: 1482#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1483#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1606#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1594#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1510#L15-1 [2020-07-01 11:13:56,052 INFO L796 eck$LassoCheckResult]: Loop: 1510#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1511#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1605#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1593#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1510#L15-1 [2020-07-01 11:13:56,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2096659, now seen corresponding path program 1 times [2020-07-01 11:13:56,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:56,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524048194] [2020-07-01 11:13:56,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:56,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2305196, now seen corresponding path program 2 times [2020-07-01 11:13:56,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:56,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050352612] [2020-07-01 11:13:56,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:56,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:56,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:56,070 INFO L82 PathProgramCache]: Analyzing trace with hash -720252482, now seen corresponding path program 1 times [2020-07-01 11:13:56,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:56,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482438971] [2020-07-01 11:13:56,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:56,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482438971] [2020-07-01 11:13:56,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:13:56,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:13:56,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628625858] [2020-07-01 11:13:56,111 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:13:56,112 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:13:56,112 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:13:56,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:13:56,112 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:13:56,112 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:56,112 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:13:56,112 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:13:56,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-07-01 11:13:56,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:13:56,113 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:13:56,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,172 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:13:56,172 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:56,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:13:56,175 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:56,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:13:56,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:13:56,336 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:13:56,339 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:13:56,339 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:13:56,339 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:13:56,339 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:13:56,339 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:13:56,339 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:56,340 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:13:56,340 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:13:56,340 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-07-01 11:13:56,340 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:13:56,340 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:13:56,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,407 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:13:56,407 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:56,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:13:56,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:13:56,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:13:56,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:13:56,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:13:56,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:13:56,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:13:56,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:13:56,418 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:13:56,421 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:13:56,421 INFO L444 ModelExtractionUtils]: 0 out of 3 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 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:56,425 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:13:56,425 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:13:56,425 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:13:56,425 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2020-07-01 11:13:56,455 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:13:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:56,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:56,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:56,486 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:13:56,487 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:56,508 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:56,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:56,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:56,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:56,524 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-07-01 11:13:56,524 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 5 loop predicates [2020-07-01 11:13:56,524 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 147 states and 288 transitions. cyclomatic complexity: 153 Second operand 3 states. [2020-07-01 11:13:56,626 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 147 states and 288 transitions. cyclomatic complexity: 153. Second operand 3 states. Result 729 states and 1418 transitions. Complement of second has 16 states. [2020-07-01 11:13:56,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-01 11:13:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 11:13:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2020-07-01 11:13:56,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-01 11:13:56,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:56,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-01 11:13:56,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:56,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-01 11:13:56,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:56,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 729 states and 1418 transitions. [2020-07-01 11:13:56,638 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 120 [2020-07-01 11:13:56,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 729 states to 243 states and 462 transitions. [2020-07-01 11:13:56,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2020-07-01 11:13:56,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2020-07-01 11:13:56,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 243 states and 462 transitions. [2020-07-01 11:13:56,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:56,643 INFO L688 BuchiCegarLoop]: Abstraction has 243 states and 462 transitions. [2020-07-01 11:13:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 462 transitions. [2020-07-01 11:13:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 138. [2020-07-01 11:13:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-01 11:13:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 273 transitions. [2020-07-01 11:13:56,652 INFO L711 BuchiCegarLoop]: Abstraction has 138 states and 273 transitions. [2020-07-01 11:13:56,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:56,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:13:56,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:13:56,653 INFO L87 Difference]: Start difference. First operand 138 states and 273 transitions. Second operand 3 states. [2020-07-01 11:13:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:56,680 INFO L93 Difference]: Finished difference Result 100 states and 188 transitions. [2020-07-01 11:13:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:13:56,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 188 transitions. [2020-07-01 11:13:56,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2020-07-01 11:13:56,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 96 states and 180 transitions. [2020-07-01 11:13:56,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-07-01 11:13:56,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-07-01 11:13:56,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 180 transitions. [2020-07-01 11:13:56,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:56,686 INFO L688 BuchiCegarLoop]: Abstraction has 96 states and 180 transitions. [2020-07-01 11:13:56,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 180 transitions. [2020-07-01 11:13:56,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 62. [2020-07-01 11:13:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-01 11:13:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 119 transitions. [2020-07-01 11:13:56,690 INFO L711 BuchiCegarLoop]: Abstraction has 62 states and 119 transitions. [2020-07-01 11:13:56,690 INFO L591 BuchiCegarLoop]: Abstraction has 62 states and 119 transitions. [2020-07-01 11:13:56,690 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 11:13:56,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 119 transitions. [2020-07-01 11:13:56,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-07-01 11:13:56,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:56,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:56,692 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 11:13:56,692 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:13:56,692 INFO L794 eck$LassoCheckResult]: Stem: 2676#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2677#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2681#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2703#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2715#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2695#L18-1 [2020-07-01 11:13:56,692 INFO L796 eck$LassoCheckResult]: Loop: 2695#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2712#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 2708#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2709#L15-1 [58] L15-1-->L18-1: Formula: (and (< 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2695#L18-1 [2020-07-01 11:13:56,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:56,693 INFO L82 PathProgramCache]: Analyzing trace with hash 64986492, now seen corresponding path program 1 times [2020-07-01 11:13:56,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:56,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276158284] [2020-07-01 11:13:56,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:56,703 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2197648, now seen corresponding path program 1 times [2020-07-01 11:13:56,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:56,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685109063] [2020-07-01 11:13:56,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:56,711 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:56,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1481641845, now seen corresponding path program 1 times [2020-07-01 11:13:56,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:56,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170345220] [2020-07-01 11:13:56,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:56,740 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 11:13:56,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170345220] [2020-07-01 11:13:56,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197003066] [2020-07-01 11:13:56,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:13:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:56,764 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:56,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 11:13:56,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:13:56,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2020-07-01 11:13:56,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025484084] [2020-07-01 11:13:56,803 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:13:56,804 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:13:56,804 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:13:56,804 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:13:56,804 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:13:56,804 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:56,804 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:13:56,804 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:13:56,804 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-07-01 11:13:56,804 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:13:56,805 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:13:56,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,870 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:13:56,870 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:56,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:13:56,876 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:56,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:13:56,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:13:56,918 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:13:56,949 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:13:56,949 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:13:56,949 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:13:56,949 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:13:56,949 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:13:56,950 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:56,950 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:13:56,950 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:13:56,950 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-07-01 11:13:56,950 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:13:56,950 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:13:56,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:56,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:57,023 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:13:57,024 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:57,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:13:57,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:13:57,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:13:57,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:13:57,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:13:57,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:13:57,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:13:57,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:13:57,038 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:13:57,040 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 11:13:57,040 INFO L444 ModelExtractionUtils]: 1 out of 3 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 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:57,049 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:13:57,049 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:13:57,049 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:13:57,049 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-01 11:13:57,080 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:13:57,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,101 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:57,102 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,107 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:13:57,107 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,140 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:13:57,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,158 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:13:57,159 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:57,173 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 11:13:57,173 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-01 11:13:57,173 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 62 states and 119 transitions. cyclomatic complexity: 60 Second operand 4 states. [2020-07-01 11:13:57,282 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 62 states and 119 transitions. cyclomatic complexity: 60. Second operand 4 states. Result 354 states and 636 transitions. Complement of second has 35 states. [2020-07-01 11:13:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-07-01 11:13:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 11:13:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2020-07-01 11:13:57,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-01 11:13:57,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:57,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-01 11:13:57,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:57,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-01 11:13:57,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:13:57,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 636 transitions. [2020-07-01 11:13:57,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2020-07-01 11:13:57,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 116 states and 202 transitions. [2020-07-01 11:13:57,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-07-01 11:13:57,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-07-01 11:13:57,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 202 transitions. [2020-07-01 11:13:57,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:57,291 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 202 transitions. [2020-07-01 11:13:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 202 transitions. [2020-07-01 11:13:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2020-07-01 11:13:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-01 11:13:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 130 transitions. [2020-07-01 11:13:57,295 INFO L711 BuchiCegarLoop]: Abstraction has 73 states and 130 transitions. [2020-07-01 11:13:57,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:57,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:13:57,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:13:57,296 INFO L87 Difference]: Start difference. First operand 73 states and 130 transitions. Second operand 3 states. [2020-07-01 11:13:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:57,318 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2020-07-01 11:13:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:13:57,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 104 transitions. [2020-07-01 11:13:57,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2020-07-01 11:13:57,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 104 transitions. [2020-07-01 11:13:57,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-01 11:13:57,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-01 11:13:57,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 104 transitions. [2020-07-01 11:13:57,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:57,321 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 104 transitions. [2020-07-01 11:13:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 104 transitions. [2020-07-01 11:13:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2020-07-01 11:13:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-01 11:13:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2020-07-01 11:13:57,324 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 95 transitions. [2020-07-01 11:13:57,324 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 95 transitions. [2020-07-01 11:13:57,325 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 11:13:57,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 95 transitions. [2020-07-01 11:13:57,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-07-01 11:13:57,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:57,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:57,326 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:13:57,326 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-01 11:13:57,326 INFO L794 eck$LassoCheckResult]: Stem: 3356#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 3357#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3360#L12 [2020-07-01 11:13:57,327 INFO L796 eck$LassoCheckResult]: Loop: 3360#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3352#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3353#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3393#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3359#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3354#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3355#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3405#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3360#L12 [2020-07-01 11:13:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 1 times [2020-07-01 11:13:57,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:57,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706764980] [2020-07-01 11:13:57,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:57,334 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1271989257, now seen corresponding path program 1 times [2020-07-01 11:13:57,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:57,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655173280] [2020-07-01 11:13:57,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,357 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 11:13:57,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655173280] [2020-07-01 11:13:57,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766153342] [2020-07-01 11:13:57,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:13:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:57,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:57,383 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 11:13:57,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:13:57,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-01 11:13:57,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657600905] [2020-07-01 11:13:57,384 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:13:57,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:57,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:13:57,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:13:57,385 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. cyclomatic complexity: 38 Second operand 4 states. [2020-07-01 11:13:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:57,441 INFO L93 Difference]: Finished difference Result 78 states and 119 transitions. [2020-07-01 11:13:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:13:57,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 119 transitions. [2020-07-01 11:13:57,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2020-07-01 11:13:57,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 70 states and 110 transitions. [2020-07-01 11:13:57,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-07-01 11:13:57,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-07-01 11:13:57,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 110 transitions. [2020-07-01 11:13:57,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:57,451 INFO L688 BuchiCegarLoop]: Abstraction has 70 states and 110 transitions. [2020-07-01 11:13:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 110 transitions. [2020-07-01 11:13:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2020-07-01 11:13:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-01 11:13:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2020-07-01 11:13:57,457 INFO L711 BuchiCegarLoop]: Abstraction has 66 states and 105 transitions. [2020-07-01 11:13:57,457 INFO L591 BuchiCegarLoop]: Abstraction has 66 states and 105 transitions. [2020-07-01 11:13:57,458 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 11:13:57,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 105 transitions. [2020-07-01 11:13:57,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2020-07-01 11:13:57,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:57,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:57,459 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:13:57,459 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-07-01 11:13:57,461 INFO L794 eck$LassoCheckResult]: Stem: 3521#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 3522#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3567#L12 [2020-07-01 11:13:57,462 INFO L796 eck$LassoCheckResult]: Loop: 3567#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3563#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3564#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3523#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3525#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3519#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3520#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3569#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3567#L12 [2020-07-01 11:13:57,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 2 times [2020-07-01 11:13:57,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:57,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493134510] [2020-07-01 11:13:57,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:57,472 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1272007516, now seen corresponding path program 1 times [2020-07-01 11:13:57,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:57,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733341975] [2020-07-01 11:13:57,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,505 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 11:13:57,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733341975] [2020-07-01 11:13:57,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928376068] [2020-07-01 11:13:57,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:13:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,526 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:57,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 11:13:57,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:13:57,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2020-07-01 11:13:57,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905846857] [2020-07-01 11:13:57,530 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:13:57,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:13:57,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:13:57,530 INFO L87 Difference]: Start difference. First operand 66 states and 105 transitions. cyclomatic complexity: 41 Second operand 3 states. [2020-07-01 11:13:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:57,556 INFO L93 Difference]: Finished difference Result 53 states and 79 transitions. [2020-07-01 11:13:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:13:57,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 79 transitions. [2020-07-01 11:13:57,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2020-07-01 11:13:57,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 42 states and 62 transitions. [2020-07-01 11:13:57,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-01 11:13:57,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-01 11:13:57,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2020-07-01 11:13:57,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:57,560 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. [2020-07-01 11:13:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2020-07-01 11:13:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 11:13:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 11:13:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2020-07-01 11:13:57,562 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. [2020-07-01 11:13:57,562 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. [2020-07-01 11:13:57,562 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 11:13:57,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 62 transitions. [2020-07-01 11:13:57,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2020-07-01 11:13:57,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:57,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:57,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:13:57,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-07-01 11:13:57,563 INFO L794 eck$LassoCheckResult]: Stem: 3668#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 3669#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3671#L12 [2020-07-01 11:13:57,564 INFO L796 eck$LassoCheckResult]: Loop: 3671#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3664#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3665#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3695#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3694#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3693#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3690#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3692#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3681#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3666#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3667#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3672#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3671#L12 [2020-07-01 11:13:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 3 times [2020-07-01 11:13:57,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:57,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346842864] [2020-07-01 11:13:57,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:57,570 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,570 INFO L82 PathProgramCache]: Analyzing trace with hash 216185799, now seen corresponding path program 2 times [2020-07-01 11:13:57,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:57,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313242446] [2020-07-01 11:13:57,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:57,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313242446] [2020-07-01 11:13:57,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143446475] [2020-07-01 11:13:57,607 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:13:57,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:13:57,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:13:57,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:13:57,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:57,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:13:57,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-01 11:13:57,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419587598] [2020-07-01 11:13:57,641 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:13:57,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:57,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:13:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:13:57,642 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. cyclomatic complexity: 23 Second operand 5 states. [2020-07-01 11:13:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:57,685 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2020-07-01 11:13:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:13:57,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 69 transitions. [2020-07-01 11:13:57,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2020-07-01 11:13:57,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 67 transitions. [2020-07-01 11:13:57,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-07-01 11:13:57,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-07-01 11:13:57,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 67 transitions. [2020-07-01 11:13:57,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:57,689 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 67 transitions. [2020-07-01 11:13:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 67 transitions. [2020-07-01 11:13:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2020-07-01 11:13:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 11:13:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2020-07-01 11:13:57,691 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 66 transitions. [2020-07-01 11:13:57,691 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 66 transitions. [2020-07-01 11:13:57,691 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 11:13:57,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 66 transitions. [2020-07-01 11:13:57,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-07-01 11:13:57,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:57,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:57,692 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:13:57,692 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 1, 1, 1] [2020-07-01 11:13:57,693 INFO L794 eck$LassoCheckResult]: Stem: 3800#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 3801#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3824#L12 [2020-07-01 11:13:57,693 INFO L796 eck$LassoCheckResult]: Loop: 3824#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3796#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3797#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3814#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3836#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3835#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3834#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3833#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3832#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3831#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3822#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3829#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3818#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3798#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3799#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3811#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3824#L12 [2020-07-01 11:13:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 4 times [2020-07-01 11:13:57,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:57,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142631943] [2020-07-01 11:13:57,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:57,699 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash -88710011, now seen corresponding path program 3 times [2020-07-01 11:13:57,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:57,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721176417] [2020-07-01 11:13:57,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:57,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721176417] [2020-07-01 11:13:57,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856145178] [2020-07-01 11:13:57,750 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:13:57,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-01 11:13:57,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:13:57,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:13:57,779 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:57,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:13:57,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 11:13:57,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156984620] [2020-07-01 11:13:57,786 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:13:57,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:57,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:13:57,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:13:57,786 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. cyclomatic complexity: 23 Second operand 6 states. [2020-07-01 11:13:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:57,848 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2020-07-01 11:13:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:13:57,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 73 transitions. [2020-07-01 11:13:57,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2020-07-01 11:13:57,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 71 transitions. [2020-07-01 11:13:57,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-07-01 11:13:57,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-07-01 11:13:57,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 71 transitions. [2020-07-01 11:13:57,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:57,852 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2020-07-01 11:13:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 71 transitions. [2020-07-01 11:13:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2020-07-01 11:13:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 11:13:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2020-07-01 11:13:57,854 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 70 transitions. [2020-07-01 11:13:57,854 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 70 transitions. [2020-07-01 11:13:57,854 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-01 11:13:57,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 70 transitions. [2020-07-01 11:13:57,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2020-07-01 11:13:57,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:57,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:57,855 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:13:57,855 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2020-07-01 11:13:57,856 INFO L794 eck$LassoCheckResult]: Stem: 3953#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 3954#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3955#L12 [2020-07-01 11:13:57,856 INFO L796 eck$LassoCheckResult]: Loop: 3955#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3958#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3988#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3987#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3986#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3985#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3984#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3983#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3982#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3981#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3980#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3979#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3978#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3977#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3970#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3974#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3959#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 3951#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3952#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3966#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3955#L12 [2020-07-01 11:13:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 5 times [2020-07-01 11:13:57,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:57,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065657291] [2020-07-01 11:13:57,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:57,862 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:57,863 INFO L82 PathProgramCache]: Analyzing trace with hash 283868739, now seen corresponding path program 4 times [2020-07-01 11:13:57,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:57,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577351556] [2020-07-01 11:13:57,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:57,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577351556] [2020-07-01 11:13:57,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622589612] [2020-07-01 11:13:57,919 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:13:57,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-01 11:13:57,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:13:57,944 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:13:57,945 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:57,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:13:57,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-01 11:13:57,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710458427] [2020-07-01 11:13:57,953 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:13:57,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:57,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:13:57,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:13:57,953 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. cyclomatic complexity: 23 Second operand 7 states. [2020-07-01 11:13:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:58,013 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2020-07-01 11:13:58,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 11:13:58,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 77 transitions. [2020-07-01 11:13:58,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2020-07-01 11:13:58,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 75 transitions. [2020-07-01 11:13:58,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-07-01 11:13:58,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-07-01 11:13:58,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 75 transitions. [2020-07-01 11:13:58,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:58,017 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2020-07-01 11:13:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 75 transitions. [2020-07-01 11:13:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2020-07-01 11:13:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-01 11:13:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2020-07-01 11:13:58,019 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2020-07-01 11:13:58,019 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2020-07-01 11:13:58,019 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-01 11:13:58,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 74 transitions. [2020-07-01 11:13:58,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2020-07-01 11:13:58,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:58,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:58,020 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:13:58,020 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 5, 1, 1, 1] [2020-07-01 11:13:58,021 INFO L794 eck$LassoCheckResult]: Stem: 4127#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4128#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4129#L12 [2020-07-01 11:13:58,021 INFO L796 eck$LassoCheckResult]: Loop: 4129#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4132#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4167#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4166#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4165#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4164#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4163#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4162#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4161#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4160#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4159#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4158#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4157#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4156#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4155#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4154#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4153#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4152#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4144#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4148#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4149#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4125#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4126#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4139#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4129#L12 [2020-07-01 11:13:58,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 6 times [2020-07-01 11:13:58,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452198591] [2020-07-01 11:13:58,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,028 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1868663041, now seen corresponding path program 5 times [2020-07-01 11:13:58,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869467225] [2020-07-01 11:13:58,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:58,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869467225] [2020-07-01 11:13:58,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881534892] [2020-07-01 11:13:58,090 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:13:58,113 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-01 11:13:58,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:13:58,114 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:13:58,115 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:58,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:13:58,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-01 11:13:58,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580620606] [2020-07-01 11:13:58,123 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:13:58,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:13:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:13:58,124 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. cyclomatic complexity: 23 Second operand 8 states. [2020-07-01 11:13:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:58,193 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2020-07-01 11:13:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 11:13:58,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 81 transitions. [2020-07-01 11:13:58,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2020-07-01 11:13:58,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 59 states and 79 transitions. [2020-07-01 11:13:58,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-07-01 11:13:58,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-07-01 11:13:58,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 79 transitions. [2020-07-01 11:13:58,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:58,196 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 79 transitions. [2020-07-01 11:13:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 79 transitions. [2020-07-01 11:13:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2020-07-01 11:13:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-01 11:13:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2020-07-01 11:13:58,198 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2020-07-01 11:13:58,198 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2020-07-01 11:13:58,199 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-01 11:13:58,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 78 transitions. [2020-07-01 11:13:58,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2020-07-01 11:13:58,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:58,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:58,200 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:13:58,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 6, 1, 1, 1] [2020-07-01 11:13:58,200 INFO L794 eck$LassoCheckResult]: Stem: 4322#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4323#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4324#L12 [2020-07-01 11:13:58,201 INFO L796 eck$LassoCheckResult]: Loop: 4324#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4327#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4366#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4365#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4364#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4363#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4362#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4361#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4360#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4359#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4358#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4357#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4356#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4355#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4354#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4353#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4352#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4351#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4350#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4349#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4348#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4347#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4339#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4343#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4344#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4320#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4321#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4335#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4324#L12 [2020-07-01 11:13:58,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 7 times [2020-07-01 11:13:58,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904006966] [2020-07-01 11:13:58,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash 976749759, now seen corresponding path program 6 times [2020-07-01 11:13:58,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,207 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435590303] [2020-07-01 11:13:58,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:58,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435590303] [2020-07-01 11:13:58,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480658187] [2020-07-01 11:13:58,296 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:13:58,327 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-01 11:13:58,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:13:58,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:13:58,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:58,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:13:58,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-01 11:13:58,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399364770] [2020-07-01 11:13:58,340 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:13:58,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:58,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 11:13:58,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-01 11:13:58,341 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. cyclomatic complexity: 23 Second operand 9 states. [2020-07-01 11:13:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:58,417 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2020-07-01 11:13:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 11:13:58,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 85 transitions. [2020-07-01 11:13:58,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 54 [2020-07-01 11:13:58,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 63 states and 83 transitions. [2020-07-01 11:13:58,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-07-01 11:13:58,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-07-01 11:13:58,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 83 transitions. [2020-07-01 11:13:58,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:58,421 INFO L688 BuchiCegarLoop]: Abstraction has 63 states and 83 transitions. [2020-07-01 11:13:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 83 transitions. [2020-07-01 11:13:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2020-07-01 11:13:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-01 11:13:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2020-07-01 11:13:58,423 INFO L711 BuchiCegarLoop]: Abstraction has 62 states and 82 transitions. [2020-07-01 11:13:58,423 INFO L591 BuchiCegarLoop]: Abstraction has 62 states and 82 transitions. [2020-07-01 11:13:58,423 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-01 11:13:58,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 82 transitions. [2020-07-01 11:13:58,424 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2020-07-01 11:13:58,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:58,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:58,425 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:13:58,425 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 7, 1, 1, 1] [2020-07-01 11:13:58,425 INFO L794 eck$LassoCheckResult]: Stem: 4538#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4539#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4540#L12 [2020-07-01 11:13:58,426 INFO L796 eck$LassoCheckResult]: Loop: 4540#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4543#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4586#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4585#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4584#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4583#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4582#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4581#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4580#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4579#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4578#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4577#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4576#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4575#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4574#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4573#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4572#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4571#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4570#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4569#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4568#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4567#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4566#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4565#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4564#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4563#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4555#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4559#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4560#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4536#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4537#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4550#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4540#L12 [2020-07-01 11:13:58,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 8 times [2020-07-01 11:13:58,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169767332] [2020-07-01 11:13:58,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,432 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2043572605, now seen corresponding path program 7 times [2020-07-01 11:13:58,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337625161] [2020-07-01 11:13:58,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:58,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337625161] [2020-07-01 11:13:58,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220049882] [2020-07-01 11:13:58,519 INFO L92 rtionOrderModulation]: Changing assertion order to 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 11:13:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:58,550 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:13:58,551 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:58,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:13:58,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-07-01 11:13:58,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355923131] [2020-07-01 11:13:58,563 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:13:58,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:58,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 11:13:58,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:13:58,564 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. cyclomatic complexity: 23 Second operand 10 states. [2020-07-01 11:13:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:58,637 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2020-07-01 11:13:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 11:13:58,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 89 transitions. [2020-07-01 11:13:58,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2020-07-01 11:13:58,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 67 states and 87 transitions. [2020-07-01 11:13:58,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-07-01 11:13:58,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-07-01 11:13:58,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 87 transitions. [2020-07-01 11:13:58,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:58,640 INFO L688 BuchiCegarLoop]: Abstraction has 67 states and 87 transitions. [2020-07-01 11:13:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 87 transitions. [2020-07-01 11:13:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2020-07-01 11:13:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-01 11:13:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2020-07-01 11:13:58,643 INFO L711 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2020-07-01 11:13:58,643 INFO L591 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2020-07-01 11:13:58,643 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-01 11:13:58,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 86 transitions. [2020-07-01 11:13:58,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2020-07-01 11:13:58,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:58,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:58,644 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:13:58,644 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 8, 1, 1, 1] [2020-07-01 11:13:58,644 INFO L794 eck$LassoCheckResult]: Stem: 4775#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 4776#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4777#L12 [2020-07-01 11:13:58,645 INFO L796 eck$LassoCheckResult]: Loop: 4777#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4780#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4827#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4826#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4825#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4824#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4823#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4822#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4821#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4820#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4819#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4818#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4817#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4816#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4815#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4814#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4813#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4812#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4811#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4810#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4809#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4808#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4807#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4806#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4805#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4804#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4803#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4802#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4801#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4800#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 4792#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4796#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4797#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 4773#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 4774#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4787#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 4777#L12 [2020-07-01 11:13:58,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 9 times [2020-07-01 11:13:58,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750185718] [2020-07-01 11:13:58,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:58,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,651 INFO L82 PathProgramCache]: Analyzing trace with hash -87797957, now seen corresponding path program 8 times [2020-07-01 11:13:58,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655419313] [2020-07-01 11:13:58,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:58,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655419313] [2020-07-01 11:13:58,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371057046] [2020-07-01 11:13:58,756 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:13:58,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:13:58,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:13:58,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:13:58,786 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:13:58,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:13:58,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-07-01 11:13:58,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858575692] [2020-07-01 11:13:58,798 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:13:58,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:13:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 11:13:58,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-01 11:13:58,799 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. cyclomatic complexity: 23 Second operand 11 states. [2020-07-01 11:13:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:13:58,923 INFO L93 Difference]: Finished difference Result 139 states and 187 transitions. [2020-07-01 11:13:58,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 11:13:58,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 187 transitions. [2020-07-01 11:13:58,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 100 [2020-07-01 11:13:58,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 137 states and 185 transitions. [2020-07-01 11:13:58,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-07-01 11:13:58,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-07-01 11:13:58,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 185 transitions. [2020-07-01 11:13:58,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:13:58,928 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 185 transitions. [2020-07-01 11:13:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 185 transitions. [2020-07-01 11:13:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2020-07-01 11:13:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-01 11:13:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2020-07-01 11:13:58,931 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 172 transitions. [2020-07-01 11:13:58,931 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 172 transitions. [2020-07-01 11:13:58,931 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2020-07-01 11:13:58,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 172 transitions. [2020-07-01 11:13:58,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2020-07-01 11:13:58,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:13:58,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:13:58,933 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:13:58,933 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 9, 1, 1, 1] [2020-07-01 11:13:58,933 INFO L794 eck$LassoCheckResult]: Stem: 5099#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5100#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5101#L12 [2020-07-01 11:13:58,934 INFO L796 eck$LassoCheckResult]: Loop: 5101#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5095#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5096#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5152#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5151#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 5150#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5149#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5148#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5147#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 5146#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5145#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5144#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5143#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 5142#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5141#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5140#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5139#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 5138#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5137#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5136#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5135#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 5134#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5133#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5132#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5131#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 5130#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5129#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5128#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5127#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 5126#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5125#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5124#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5123#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 5122#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 5119#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5121#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5105#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 5097#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 5098#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5107#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 5101#L12 [2020-07-01 11:13:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 10 times [2020-07-01 11:13:58,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420651940] [2020-07-01 11:13:58,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash 771300857, now seen corresponding path program 9 times [2020-07-01 11:13:58,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380343250] [2020-07-01 11:13:58,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,958 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:58,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash 625420156, now seen corresponding path program 1 times [2020-07-01 11:13:58,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:13:58,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448211270] [2020-07-01 11:13:58,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:13:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:13:58,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:13:59,207 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 40 [2020-07-01 11:13:59,221 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:13:59,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:13:59,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:13:59,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:13:59,222 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:13:59,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:13:59,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:13:59,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:13:59,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop [2020-07-01 11:13:59,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:13:59,222 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:13:59,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:59,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:59,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:59,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 11:13:59,307 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:13:59,308 INFO L404 LassoAnalysis]: Checking for nontermination... 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 11:13:59,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:13:59,315 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 11:13:59,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:13:59,368 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:13:59,373 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:13:59,403 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:13:59,403 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:13:59,403 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:13:59,403 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:13:59,403 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:13:59,403 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:59,404 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:13:59,404 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:13:59,404 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop [2020-07-01 11:13:59,404 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:13:59,404 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:13:59,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:59,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:59,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:59,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:13:59,469 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:13:59,469 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:59,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:13:59,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:13:59,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:13:59,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:13:59,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:13:59,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:13:59,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:13:59,481 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:59,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:13:59,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:13:59,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:13:59,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:13:59,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:13:59,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:13:59,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:13:59,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:13:59,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:13:59,523 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:13:59,523 INFO L444 ModelExtractionUtils]: 0 out of 3 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:13:59,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:13:59,527 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:13:59,527 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:13:59,528 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 5 Supporting invariants [] [2020-07-01 11:13:59,557 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:13:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:13:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,598 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,600 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-07-01 11:13:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,692 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,734 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,753 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,754 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,772 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,773 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,791 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,811 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,863 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,864 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,943 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,962 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,963 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,980 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,981 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:13:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:13:59,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:13:59,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,020 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,044 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,045 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,059 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,114 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,133 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,153 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,158 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,177 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,195 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,214 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,229 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,244 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,265 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,327 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,372 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,373 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,391 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:00,440 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:00,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:00,444 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-07-01 11:14:00,445 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 11:14:00,445 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 125 states and 172 transitions. cyclomatic complexity: 50 Second operand 5 states. [2020-07-01 11:14:00,730 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 125 states and 172 transitions. cyclomatic complexity: 50. Second operand 5 states. Result 1673 states and 2202 transitions. Complement of second has 341 states. [2020-07-01 11:14:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2020-07-01 11:14:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 11:14:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 96 transitions. [2020-07-01 11:14:00,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 96 transitions. Stem has 2 letters. Loop has 40 letters. [2020-07-01 11:14:00,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:00,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 96 transitions. Stem has 42 letters. Loop has 40 letters. [2020-07-01 11:14:00,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:00,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 96 transitions. Stem has 2 letters. Loop has 80 letters. [2020-07-01 11:14:00,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:00,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1673 states and 2202 transitions. [2020-07-01 11:14:00,751 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 143 [2020-07-01 11:14:00,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1673 states to 301 states and 366 transitions. [2020-07-01 11:14:00,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2020-07-01 11:14:00,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2020-07-01 11:14:00,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 301 states and 366 transitions. [2020-07-01 11:14:00,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:14:00,755 INFO L688 BuchiCegarLoop]: Abstraction has 301 states and 366 transitions. [2020-07-01 11:14:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states and 366 transitions. [2020-07-01 11:14:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 127. [2020-07-01 11:14:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-07-01 11:14:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 156 transitions. [2020-07-01 11:14:00,759 INFO L711 BuchiCegarLoop]: Abstraction has 127 states and 156 transitions. [2020-07-01 11:14:00,759 INFO L591 BuchiCegarLoop]: Abstraction has 127 states and 156 transitions. [2020-07-01 11:14:00,759 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2020-07-01 11:14:00,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 156 transitions. [2020-07-01 11:14:00,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2020-07-01 11:14:00,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:14:00,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:14:00,761 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:14:00,761 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2020-07-01 11:14:00,761 INFO L794 eck$LassoCheckResult]: Stem: 11851#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 11852#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11853#L12 [2020-07-01 11:14:00,762 INFO L796 eck$LassoCheckResult]: Loop: 11853#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 11857#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 11848#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11909#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11907#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 11906#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 11862#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11863#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11902#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 11901#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 11900#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11899#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11898#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 11897#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 11896#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11895#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11894#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 11893#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 11892#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11891#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11890#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 11889#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 11888#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11887#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11886#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 11885#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 11884#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11883#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11882#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 11881#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 11880#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11879#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11878#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 11877#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 11872#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11875#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11876#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 11919#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 11920#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11860#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11924#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 11913#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 11912#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 11908#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 11853#L12 [2020-07-01 11:14:00,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:00,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 11 times [2020-07-01 11:14:00,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:00,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734183900] [2020-07-01 11:14:00,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:00,768 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash 804284075, now seen corresponding path program 10 times [2020-07-01 11:14:00,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:00,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178522033] [2020-07-01 11:14:00,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:00,787 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1447556782, now seen corresponding path program 2 times [2020-07-01 11:14:00,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:00,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718001481] [2020-07-01 11:14:00,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:00,819 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:00,990 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2020-07-01 11:14:01,001 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:01,001 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:01,001 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:01,001 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:01,001 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:14:01,001 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:01,001 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:01,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:01,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Loop [2020-07-01 11:14:01,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:01,002 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:01,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:01,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:01,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:01,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:01,053 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:01,053 INFO L404 LassoAnalysis]: Checking for nontermination... 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 11:14:01,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:01,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:01,061 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:01,061 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 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 11:14:01,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:01,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:01,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:01,100 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 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 11:14:01,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:01,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:01,138 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:01,138 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=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) [2020-07-01 11:14:01,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:01,171 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 11:14:01,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:14:01,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:01,215 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:14:01,245 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:01,245 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:01,245 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:01,245 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:01,245 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:14:01,245 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:01,246 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:01,246 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:01,246 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Loop [2020-07-01 11:14:01,246 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:01,246 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:01,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:01,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:01,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:01,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:01,309 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:01,309 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:01,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:01,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:01,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:01,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:01,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:01,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:14:01,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:14:01,321 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:01,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:01,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:01,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:01,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:01,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:01,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:01,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:01,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:01,360 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:01,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:01,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:01,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:01,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:01,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:01,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:14:01,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:14:01,399 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 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:01,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:01,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:01,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:01,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:01,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:01,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:01,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:01,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:01,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:14:01,441 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:14:01,441 INFO L444 ModelExtractionUtils]: 0 out of 3 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:01,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:14:01,445 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:14:01,445 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:14:01,445 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2020-07-01 11:14:01,474 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:14:01,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,500 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,501 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-07-01 11:14:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,600 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,601 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,622 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,671 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,672 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,796 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,797 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,817 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,853 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,854 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,911 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,912 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,931 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,950 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,951 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:01,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:01,986 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,059 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,081 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,095 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,141 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,142 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,171 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,307 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,350 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,351 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,387 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,475 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:02,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:02,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:02,511 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 11 predicates after loop cannibalization [2020-07-01 11:14:02,511 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 11 loop predicates [2020-07-01 11:14:02,511 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 127 states and 156 transitions. cyclomatic complexity: 32 Second operand 6 states. [2020-07-01 11:14:03,343 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 127 states and 156 transitions. cyclomatic complexity: 32. Second operand 6 states. Result 3803 states and 4614 transitions. Complement of second has 955 states. [2020-07-01 11:14:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 26 states 1 stem states 23 non-accepting loop states 1 accepting loop states [2020-07-01 11:14:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-01 11:14:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 136 transitions. [2020-07-01 11:14:03,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 136 transitions. Stem has 2 letters. Loop has 44 letters. [2020-07-01 11:14:03,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:03,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 136 transitions. Stem has 46 letters. Loop has 44 letters. [2020-07-01 11:14:03,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:03,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 136 transitions. Stem has 2 letters. Loop has 88 letters. [2020-07-01 11:14:03,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:03,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3803 states and 4614 transitions. [2020-07-01 11:14:03,383 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 174 [2020-07-01 11:14:03,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3803 states to 408 states and 481 transitions. [2020-07-01 11:14:03,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2020-07-01 11:14:03,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2020-07-01 11:14:03,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 481 transitions. [2020-07-01 11:14:03,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:14:03,387 INFO L688 BuchiCegarLoop]: Abstraction has 408 states and 481 transitions. [2020-07-01 11:14:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 481 transitions. [2020-07-01 11:14:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 127. [2020-07-01 11:14:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-07-01 11:14:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2020-07-01 11:14:03,392 INFO L711 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2020-07-01 11:14:03,392 INFO L591 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2020-07-01 11:14:03,392 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2020-07-01 11:14:03,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 155 transitions. [2020-07-01 11:14:03,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2020-07-01 11:14:03,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:14:03,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:14:03,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:14:03,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 9, 3, 1, 1] [2020-07-01 11:14:03,394 INFO L794 eck$LassoCheckResult]: Stem: 22358#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 22359#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22360#L12 [2020-07-01 11:14:03,395 INFO L796 eck$LassoCheckResult]: Loop: 22360#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 22364#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22354#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22413#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22414#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22412#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22369#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22370#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22408#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22407#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22406#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22405#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22404#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22403#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22402#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22401#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22400#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22399#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22398#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22397#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22396#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22395#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22394#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22393#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22392#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22391#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22390#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22389#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22388#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22387#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22386#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22385#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22384#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22383#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22379#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22382#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22365#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22366#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 22437#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22368#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22441#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22427#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22425#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22424#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22423#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 22422#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 22421#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 22419#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22360#L12 [2020-07-01 11:14:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:03,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 12 times [2020-07-01 11:14:03,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:03,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826963377] [2020-07-01 11:14:03,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:03,401 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:03,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1590691421, now seen corresponding path program 11 times [2020-07-01 11:14:03,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:03,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095955969] [2020-07-01 11:14:03,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:03,419 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1862917344, now seen corresponding path program 3 times [2020-07-01 11:14:03,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:03,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177816919] [2020-07-01 11:14:03,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:03,438 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:03,591 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2020-07-01 11:14:03,603 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:03,603 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:03,603 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:03,603 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:03,603 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:14:03,603 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:03,603 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:03,604 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:03,604 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop [2020-07-01 11:14:03,604 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:03,604 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:03,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:03,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:03,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:03,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:03,652 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:03,653 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:03,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:03,656 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:03,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:14:03,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:03,697 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:14:03,726 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:03,726 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:03,727 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:03,727 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:03,727 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:14:03,727 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:03,727 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:03,727 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:03,727 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop [2020-07-01 11:14:03,727 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:03,727 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:03,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:03,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:03,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:03,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:03,776 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:03,776 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:03,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:03,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:03,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:03,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:03,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:03,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:03,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:03,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:03,785 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:03,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:03,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:03,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:03,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:03,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:03,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:03,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:03,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:03,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:14:03,827 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:14:03,827 INFO L444 ModelExtractionUtils]: 0 out of 3 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:03,830 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:14:03,831 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:14:03,831 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:14:03,831 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 4 Supporting invariants [] [2020-07-01 11:14:03,860 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:14:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:03,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:14:03,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:03,886 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:03,887 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 17 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-07-01 11:14:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:03,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:03,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:03,993 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:03,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,027 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,102 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,122 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,141 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,142 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,182 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,183 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,202 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,202 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,261 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,262 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,308 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,343 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,375 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,390 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,405 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,420 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,420 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,465 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,465 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,572 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,590 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,748 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,828 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,828 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,901 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,902 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:04,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:04,971 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:05,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:05,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:05,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:05,031 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:05,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:05,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:05,055 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-07-01 11:14:05,055 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 14 loop predicates [2020-07-01 11:14:05,056 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 127 states and 155 transitions. cyclomatic complexity: 31 Second operand 7 states. [2020-07-01 11:14:06,352 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 127 states and 155 transitions. cyclomatic complexity: 31. Second operand 7 states. Result 9555 states and 11296 transitions. Complement of second has 2435 states. [2020-07-01 11:14:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 38 states 1 stem states 35 non-accepting loop states 1 accepting loop states [2020-07-01 11:14:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 11:14:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 185 transitions. [2020-07-01 11:14:06,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 185 transitions. Stem has 2 letters. Loop has 48 letters. [2020-07-01 11:14:06,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:06,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 185 transitions. Stem has 50 letters. Loop has 48 letters. [2020-07-01 11:14:06,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:06,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 185 transitions. Stem has 2 letters. Loop has 96 letters. [2020-07-01 11:14:06,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:06,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9555 states and 11296 transitions. [2020-07-01 11:14:06,445 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 222 [2020-07-01 11:14:06,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9555 states to 575 states and 673 transitions. [2020-07-01 11:14:06,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2020-07-01 11:14:06,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2020-07-01 11:14:06,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 575 states and 673 transitions. [2020-07-01 11:14:06,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:14:06,450 INFO L688 BuchiCegarLoop]: Abstraction has 575 states and 673 transitions. [2020-07-01 11:14:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states and 673 transitions. [2020-07-01 11:14:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 127. [2020-07-01 11:14:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-07-01 11:14:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 154 transitions. [2020-07-01 11:14:06,456 INFO L711 BuchiCegarLoop]: Abstraction has 127 states and 154 transitions. [2020-07-01 11:14:06,456 INFO L591 BuchiCegarLoop]: Abstraction has 127 states and 154 transitions. [2020-07-01 11:14:06,457 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2020-07-01 11:14:06,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 154 transitions. [2020-07-01 11:14:06,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2020-07-01 11:14:06,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:14:06,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:14:06,458 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 11:14:06,458 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 9, 4, 1, 1] [2020-07-01 11:14:06,459 INFO L794 eck$LassoCheckResult]: Stem: 41204#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 41205#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41206#L12 [2020-07-01 11:14:06,459 INFO L796 eck$LassoCheckResult]: Loop: 41206#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 41210#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41201#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41259#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41260#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41258#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41215#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41216#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41254#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41253#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41252#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41251#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41250#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41249#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41248#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41247#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41246#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41245#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41244#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41243#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41242#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41241#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41240#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41239#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41238#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41237#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41236#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41235#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41234#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41233#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41232#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41231#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41230#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41229#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41226#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41228#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41211#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41202#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 41203#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41213#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41288#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41277#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41275#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41274#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41273#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41272#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41271#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41270#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41269#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 41268#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 41267#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41265#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 41206#L12 [2020-07-01 11:14:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 13 times [2020-07-01 11:14:06,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:06,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078748972] [2020-07-01 11:14:06,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:06,466 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:06,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:06,467 INFO L82 PathProgramCache]: Analyzing trace with hash -795575025, now seen corresponding path program 12 times [2020-07-01 11:14:06,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:06,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341790340] [2020-07-01 11:14:06,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:06,486 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:06,487 INFO L82 PathProgramCache]: Analyzing trace with hash -349611502, now seen corresponding path program 4 times [2020-07-01 11:14:06,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:06,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532076954] [2020-07-01 11:14:06,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:06,506 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:06,749 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2020-07-01 11:14:06,759 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:06,759 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:06,759 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:06,760 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:06,760 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:14:06,760 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:06,760 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:06,760 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:06,760 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop [2020-07-01 11:14:06,760 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:06,760 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:06,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:06,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:06,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:06,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:06,821 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:06,821 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:06,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:06,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:06,830 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:06,830 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:06,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:06,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:06,866 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:06,867 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:06,899 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:06,899 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:06,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:14:06,936 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:06,940 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:14:06,969 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:06,969 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:06,969 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:06,969 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:06,970 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:14:06,970 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:06,970 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:06,970 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:06,970 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop [2020-07-01 11:14:06,970 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:06,970 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:06,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:06,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:06,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:06,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:07,019 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:07,020 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:07,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:07,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:07,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:07,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:07,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:07,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:07,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:07,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:07,030 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:07,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:07,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:07,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:07,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:07,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:07,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:14:07,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:14:07,071 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 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:07,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:07,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:07,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:07,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:07,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:07,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:07,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:07,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:07,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:14:07,111 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:14:07,112 INFO L444 ModelExtractionUtils]: 0 out of 3 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 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:07,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:14:07,115 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:14:07,115 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:14:07,116 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 11:14:07,145 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:14:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,160 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,172 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-07-01 11:14:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,322 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,323 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,339 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,339 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,355 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,374 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,374 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,390 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,428 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,483 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,483 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,523 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,539 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,600 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,619 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,620 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,660 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,660 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,700 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,741 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,762 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,811 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,849 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,880 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,880 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,917 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:07,936 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:07,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:08,190 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:08,201 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:08,212 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:08,223 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:08,239 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,257 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,547 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,568 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:08,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:08,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:08,592 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 15 predicates after loop cannibalization [2020-07-01 11:14:08,592 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 15 loop predicates [2020-07-01 11:14:08,593 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 127 states and 154 transitions. cyclomatic complexity: 30 Second operand 8 states. [2020-07-01 11:14:10,590 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 127 states and 154 transitions. cyclomatic complexity: 30. Second operand 8 states. Result 23957 states and 27768 transitions. Complement of second has 5437 states. [2020-07-01 11:14:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 41 states 1 stem states 38 non-accepting loop states 1 accepting loop states [2020-07-01 11:14:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 11:14:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 205 transitions. [2020-07-01 11:14:10,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 205 transitions. Stem has 2 letters. Loop has 52 letters. [2020-07-01 11:14:10,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:10,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 205 transitions. Stem has 54 letters. Loop has 52 letters. [2020-07-01 11:14:10,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:10,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 205 transitions. Stem has 2 letters. Loop has 104 letters. [2020-07-01 11:14:10,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:10,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23957 states and 27768 transitions. [2020-07-01 11:14:10,703 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 367 [2020-07-01 11:14:10,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23957 states to 1136 states and 1315 transitions. [2020-07-01 11:14:10,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-07-01 11:14:10,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 666 [2020-07-01 11:14:10,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1136 states and 1315 transitions. [2020-07-01 11:14:10,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:14:10,711 INFO L688 BuchiCegarLoop]: Abstraction has 1136 states and 1315 transitions. [2020-07-01 11:14:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states and 1315 transitions. [2020-07-01 11:14:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 206. [2020-07-01 11:14:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-07-01 11:14:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 256 transitions. [2020-07-01 11:14:10,721 INFO L711 BuchiCegarLoop]: Abstraction has 206 states and 256 transitions. [2020-07-01 11:14:10,721 INFO L591 BuchiCegarLoop]: Abstraction has 206 states and 256 transitions. [2020-07-01 11:14:10,721 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2020-07-01 11:14:10,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 256 transitions. [2020-07-01 11:14:10,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 133 [2020-07-01 11:14:10,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:14:10,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:14:10,723 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:14:10,723 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 9, 5, 1, 1] [2020-07-01 11:14:10,723 INFO L794 eck$LassoCheckResult]: Stem: 77875#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 77876#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77950#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77871#L12-2 [2020-07-01 11:14:10,724 INFO L796 eck$LassoCheckResult]: Loop: 77871#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77872#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77877#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77878#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 78043#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 78029#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 78028#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 78027#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 78026#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 78012#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 78011#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 78010#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 78009#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77999#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77996#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77994#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77930#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77929#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77928#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77927#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77926#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77925#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77924#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77923#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77922#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77921#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77920#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77919#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77918#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77917#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77916#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77915#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77914#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77913#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77912#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77911#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77910#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77909#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77908#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77907#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77906#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77905#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77904#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77903#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77902#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77894#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77898#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77899#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 78047#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 77887#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77879#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77880#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77884#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 78039#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 78036#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 78037#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 77871#L12-2 [2020-07-01 11:14:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash 67633, now seen corresponding path program 1 times [2020-07-01 11:14:10,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:10,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799968393] [2020-07-01 11:14:10,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:10,731 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash -498729919, now seen corresponding path program 13 times [2020-07-01 11:14:10,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:10,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861967649] [2020-07-01 11:14:10,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:10,750 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:10,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:10,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1756318607, now seen corresponding path program 5 times [2020-07-01 11:14:10,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:10,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562336979] [2020-07-01 11:14:10,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:10,769 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:10,975 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2020-07-01 11:14:10,985 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:10,985 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:10,985 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:10,985 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:10,985 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:14:10,985 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:10,986 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:10,986 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:10,986 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop [2020-07-01 11:14:10,986 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:10,986 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:10,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:10,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:10,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:11,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:11,044 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:11,044 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:11,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:11,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:11,052 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:11,052 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:11,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:11,085 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:11,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:14:11,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:11,125 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:14:11,154 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:11,155 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:11,155 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:11,155 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:11,155 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:14:11,155 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:11,155 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:11,155 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:11,155 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop [2020-07-01 11:14:11,155 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:11,155 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:11,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:11,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:11,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:11,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:11,210 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:11,211 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:11,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:11,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:11,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:11,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:11,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:11,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:14:11,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:14:11,222 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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:11,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:11,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:11,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:11,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:11,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:11,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:11,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:11,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:11,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:14:11,262 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:14:11,263 INFO L444 ModelExtractionUtils]: 0 out of 3 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:11,266 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:14:11,266 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:14:11,266 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:14:11,266 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 6 Supporting invariants [] [2020-07-01 11:14:11,296 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:14:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,322 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,323 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 85 proven. 126 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-07-01 11:14:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,417 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,477 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,536 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,683 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,700 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,717 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,921 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,952 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,953 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,969 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,970 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:11,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:11,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,017 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,018 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,050 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,082 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,082 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,145 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,161 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,240 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,256 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,256 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,272 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,272 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,304 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,319 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,335 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,352 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,352 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,368 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,417 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,448 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,597 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,616 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,617 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,637 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,637 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,782 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:12,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:12,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:12,823 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 20 predicates after loop cannibalization [2020-07-01 11:14:12,823 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 20 loop predicates [2020-07-01 11:14:12,823 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 206 states and 256 transitions. cyclomatic complexity: 53 Second operand 10 states. [2020-07-01 11:14:16,881 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 206 states and 256 transitions. cyclomatic complexity: 53. Second operand 10 states. Result 87696 states and 103761 transitions. Complement of second has 12577 states. [2020-07-01 11:14:16,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 68 states 1 stem states 65 non-accepting loop states 1 accepting loop states [2020-07-01 11:14:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 11:14:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 306 transitions. [2020-07-01 11:14:16,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 306 transitions. Stem has 3 letters. Loop has 56 letters. [2020-07-01 11:14:16,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:16,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 306 transitions. Stem has 59 letters. Loop has 56 letters. [2020-07-01 11:14:16,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:16,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 306 transitions. Stem has 3 letters. Loop has 112 letters. [2020-07-01 11:14:16,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:16,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87696 states and 103761 transitions. [2020-07-01 11:14:17,169 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 489 [2020-07-01 11:14:17,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87696 states to 1547 states and 1769 transitions. [2020-07-01 11:14:17,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-07-01 11:14:17,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2020-07-01 11:14:17,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1547 states and 1769 transitions. [2020-07-01 11:14:17,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:14:17,178 INFO L688 BuchiCegarLoop]: Abstraction has 1547 states and 1769 transitions. [2020-07-01 11:14:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states and 1769 transitions. [2020-07-01 11:14:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 192. [2020-07-01 11:14:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-07-01 11:14:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 230 transitions. [2020-07-01 11:14:17,188 INFO L711 BuchiCegarLoop]: Abstraction has 192 states and 230 transitions. [2020-07-01 11:14:17,189 INFO L591 BuchiCegarLoop]: Abstraction has 192 states and 230 transitions. [2020-07-01 11:14:17,189 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2020-07-01 11:14:17,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 230 transitions. [2020-07-01 11:14:17,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 132 [2020-07-01 11:14:17,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:14:17,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:14:17,190 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:14:17,190 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 14, 10, 6, 1, 1, 1] [2020-07-01 11:14:17,191 INFO L794 eck$LassoCheckResult]: Stem: 187608#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 187609#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187705#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187604#L12-2 [2020-07-01 11:14:17,191 INFO L796 eck$LassoCheckResult]: Loop: 187604#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187605#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187618#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187783#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187781#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187755#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187754#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187753#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187752#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187751#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187750#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187749#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187748#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187747#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187746#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187745#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 187744#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187743#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187742#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187739#L12 [54] L12-->L12-2: Formula: (> 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187736#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187734#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187732#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187611#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187694#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187655#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187654#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187653#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187652#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187651#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187650#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187649#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187648#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187647#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187646#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187645#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187644#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187643#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187642#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187641#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187640#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187639#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187638#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187637#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187636#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187635#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187634#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187633#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187632#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187631#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187630#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187629#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187628#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187625#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187627#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187616#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187606#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 187607#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187612#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187613#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187786#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 187725#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 187724#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 187723#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187604#L12-2 [2020-07-01 11:14:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:17,192 INFO L82 PathProgramCache]: Analyzing trace with hash 67633, now seen corresponding path program 2 times [2020-07-01 11:14:17,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:17,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553388544] [2020-07-01 11:14:17,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:17,197 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash -462988206, now seen corresponding path program 1 times [2020-07-01 11:14:17,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:17,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952582294] [2020-07-01 11:14:17,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2020-07-01 11:14:17,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952582294] [2020-07-01 11:14:17,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:14:17,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:14:17,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532466027] [2020-07-01 11:14:17,226 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:14:17,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:14:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:14:17,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:14:17,227 INFO L87 Difference]: Start difference. First operand 192 states and 230 transitions. cyclomatic complexity: 41 Second operand 3 states. [2020-07-01 11:14:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:14:17,243 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2020-07-01 11:14:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:14:17,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 224 transitions. [2020-07-01 11:14:17,247 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 127 [2020-07-01 11:14:17,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 192 states and 223 transitions. [2020-07-01 11:14:17,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-07-01 11:14:17,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2020-07-01 11:14:17,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 223 transitions. [2020-07-01 11:14:17,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:14:17,249 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 223 transitions. [2020-07-01 11:14:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 223 transitions. [2020-07-01 11:14:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2020-07-01 11:14:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-01 11:14:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2020-07-01 11:14:17,253 INFO L711 BuchiCegarLoop]: Abstraction has 156 states and 180 transitions. [2020-07-01 11:14:17,253 INFO L591 BuchiCegarLoop]: Abstraction has 156 states and 180 transitions. [2020-07-01 11:14:17,253 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2020-07-01 11:14:17,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 180 transitions. [2020-07-01 11:14:17,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 126 [2020-07-01 11:14:17,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:14:17,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:14:17,254 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:14:17,254 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2020-07-01 11:14:17,255 INFO L794 eck$LassoCheckResult]: Stem: 187999#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 188000#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188071#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188074#L12-2 [2020-07-01 11:14:17,256 INFO L796 eck$LassoCheckResult]: Loop: 188074#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188096#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188094#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188093#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188092#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188091#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188090#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188086#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188083#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188066#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188064#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188062#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 188060#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188057#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188055#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188052#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188051#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188050#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188049#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188048#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188047#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188046#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188045#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188044#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188043#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188042#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188041#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188040#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188039#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188038#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188037#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188036#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188035#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188034#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188033#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188032#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188031#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188030#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188029#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188028#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188027#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188026#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188025#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188024#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188023#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188015#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188021#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188022#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 187997#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 187998#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188003#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188004#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188006#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188127#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188126#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188120#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188121#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 188130#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 188129#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 188099#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 188074#L12-2 [2020-07-01 11:14:17,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:17,256 INFO L82 PathProgramCache]: Analyzing trace with hash 67633, now seen corresponding path program 3 times [2020-07-01 11:14:17,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:17,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085079412] [2020-07-01 11:14:17,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:17,260 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:17,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:17,261 INFO L82 PathProgramCache]: Analyzing trace with hash 446025551, now seen corresponding path program 14 times [2020-07-01 11:14:17,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:17,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771703949] [2020-07-01 11:14:17,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:17,280 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:17,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1579741055, now seen corresponding path program 6 times [2020-07-01 11:14:17,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:17,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837208717] [2020-07-01 11:14:17,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:17,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:17,609 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 57 [2020-07-01 11:14:17,618 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:17,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:17,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:17,619 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:17,619 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:14:17,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:17,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:17,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:17,619 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration20_Loop [2020-07-01 11:14:17,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:17,619 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:17,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:17,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:17,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:17,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:17,674 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:17,674 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:17,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:17,678 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:17,682 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:17,682 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_19=0} Honda state: {v_rep~unnamed0~0~false_19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:17,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:17,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:17,719 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:17,719 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_19=1} Honda state: {v_rep~unnamed0~0~true_19=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:17,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:17,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:17,755 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:17,755 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:17,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:17,788 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:17,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:14:17,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:17,829 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:14:17,858 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:17,858 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:17,858 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:17,858 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:17,859 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:14:17,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:17,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:17,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:17,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration20_Loop [2020-07-01 11:14:17,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:17,859 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:17,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:17,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:17,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:17,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:17,913 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:17,913 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:17,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:17,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:17,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:17,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:17,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:17,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:14:17,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:14:17,924 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 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:17,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:17,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:17,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:17,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:17,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:17,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:14:17,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:14:17,965 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 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:17,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:17,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:17,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:17,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:17,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:18,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:18,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:18,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:18,002 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:18,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:18,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:18,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:18,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:18,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:18,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:18,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:18,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:18,041 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:14:18,043 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:14:18,044 INFO L444 ModelExtractionUtils]: 0 out of 3 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:18,047 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:14:18,047 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:14:18,047 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:14:18,047 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 11 Supporting invariants [] [2020-07-01 11:14:18,076 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:14:18,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,092 INFO L264 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,092 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,104 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,105 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 133 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-07-01 11:14:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,343 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,563 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,563 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,621 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,659 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,844 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,844 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,911 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,912 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,945 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,946 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,962 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,963 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,980 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:18,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:18,996 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,050 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,118 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,134 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,135 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,151 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,168 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,168 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,185 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,202 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,202 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,219 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,257 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,257 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,345 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,363 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,380 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,415 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,415 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,478 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,479 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,500 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,501 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,523 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,814 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:19,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:14:19,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:19,960 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:19,978 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:19,992 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:20,004 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:20,016 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:20,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:20,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:20,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:20,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:20,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:20,161 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:20,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:20,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:20,197 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:20,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:20,214 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:20,215 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:20,220 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 21 predicates after loop cannibalization [2020-07-01 11:14:20,220 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 21 loop predicates [2020-07-01 11:14:20,220 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 156 states and 180 transitions. cyclomatic complexity: 26 Second operand 11 states. [2020-07-01 11:14:26,341 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 156 states and 180 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 147112 states and 172029 transitions. Complement of second has 25161 states. [2020-07-01 11:14:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 61 states 1 stem states 58 non-accepting loop states 1 accepting loop states [2020-07-01 11:14:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 11:14:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 270 transitions. [2020-07-01 11:14:26,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 270 transitions. Stem has 3 letters. Loop has 60 letters. [2020-07-01 11:14:26,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:26,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 270 transitions. Stem has 63 letters. Loop has 60 letters. [2020-07-01 11:14:26,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:26,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 270 transitions. Stem has 3 letters. Loop has 120 letters. [2020-07-01 11:14:26,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:26,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147112 states and 172029 transitions. [2020-07-01 11:14:26,806 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 593 [2020-07-01 11:14:26,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147112 states to 1511 states and 1649 transitions. [2020-07-01 11:14:26,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2020-07-01 11:14:26,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 967 [2020-07-01 11:14:26,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1511 states and 1649 transitions. [2020-07-01 11:14:26,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:14:26,815 INFO L688 BuchiCegarLoop]: Abstraction has 1511 states and 1649 transitions. [2020-07-01 11:14:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states and 1649 transitions. [2020-07-01 11:14:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 167. [2020-07-01 11:14:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-07-01 11:14:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2020-07-01 11:14:26,825 INFO L711 BuchiCegarLoop]: Abstraction has 167 states and 196 transitions. [2020-07-01 11:14:26,825 INFO L591 BuchiCegarLoop]: Abstraction has 167 states and 196 transitions. [2020-07-01 11:14:26,825 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2020-07-01 11:14:26,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 196 transitions. [2020-07-01 11:14:26,825 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 141 [2020-07-01 11:14:26,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:14:26,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:14:26,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:14:26,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 9, 7, 1, 1] [2020-07-01 11:14:26,826 INFO L794 eck$LassoCheckResult]: Stem: 370157#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 370158#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370170#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370180#L12-2 [2020-07-01 11:14:26,827 INFO L796 eck$LassoCheckResult]: Loop: 370180#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370294#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370293#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370292#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370291#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370269#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370268#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370267#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370266#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370256#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370255#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370254#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 370253#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370252#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370250#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370247#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370245#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370244#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370243#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370236#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370235#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370234#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370233#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370232#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370231#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370230#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370229#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370228#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370227#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370226#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370225#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370224#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370223#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370222#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370221#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370220#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370219#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370218#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370217#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370216#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370215#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370214#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370212#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370213#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370210#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370209#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370205#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370207#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370155#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 370156#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370208#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370167#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370168#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370203#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370306#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370304#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370305#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370154#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370311#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370308#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370307#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 370303#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 370302#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 370301#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 370180#L12-2 [2020-07-01 11:14:26,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:26,828 INFO L82 PathProgramCache]: Analyzing trace with hash 67633, now seen corresponding path program 4 times [2020-07-01 11:14:26,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:26,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021704661] [2020-07-01 11:14:26,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:26,832 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash 831089501, now seen corresponding path program 15 times [2020-07-01 11:14:26,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:26,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496416581] [2020-07-01 11:14:26,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:26,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:26,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:26,849 INFO L82 PathProgramCache]: Analyzing trace with hash 959509389, now seen corresponding path program 7 times [2020-07-01 11:14:26,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:26,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634898074] [2020-07-01 11:14:26,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:26,867 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:27,108 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 60 [2020-07-01 11:14:27,117 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:27,117 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:27,117 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:27,117 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:27,117 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:14:27,117 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:27,117 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:27,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:27,118 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration21_Loop [2020-07-01 11:14:27,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:27,118 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:27,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:27,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:27,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:27,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:27,176 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:27,176 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:27,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:27,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:27,184 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:27,184 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:27,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:27,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:27,220 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:27,220 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_21=1} Honda state: {v_rep~unnamed0~0~true_21=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:27,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:27,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:27,257 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 11:14:27,257 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:27,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:27,290 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:27,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:14:27,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:27,331 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:14:27,360 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:27,360 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:27,360 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:27,360 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:27,360 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:14:27,360 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:27,360 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:27,360 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:27,361 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration21_Loop [2020-07-01 11:14:27,361 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:27,361 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:27,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:27,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:27,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:27,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 11:14:27,424 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:27,424 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:27,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:27,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:27,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:27,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:27,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:27,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:14:27,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:14:27,435 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 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:27,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:27,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:27,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:27,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:27,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:27,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:14:27,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:14:27,475 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 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:27,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:27,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:27,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:27,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:27,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:27,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:27,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:27,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:27,512 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 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:27,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:27,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:27,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:27,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:27,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:27,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:27,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:27,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:27,551 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:14:27,553 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:14:27,553 INFO L444 ModelExtractionUtils]: 0 out of 3 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 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:27,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:14:27,557 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:14:27,557 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:14:27,557 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 5 Supporting invariants [] [2020-07-01 11:14:27,586 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:14:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:27,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:14:27,601 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:27,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:27,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 144 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-07-01 11:14:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:27,764 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:27,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:27,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:27,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:27,910 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:27,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:27,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:27,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:27,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:27,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,173 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,451 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,563 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,581 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,598 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,599 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,616 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,634 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,669 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,670 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,687 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,705 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,741 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,742 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,759 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,848 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,865 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,899 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,917 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,952 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,953 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,970 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:28,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:28,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,005 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,022 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,040 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,040 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,058 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,075 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,076 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,092 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,093 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,355 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,378 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,379 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:29,401 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:29,415 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:29,428 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:29,441 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:29,454 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:29,467 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:29,480 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:29,494 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:29,507 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,521 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,602 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,659 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,660 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,679 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:29,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 11:14:29,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:29,704 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 23 predicates after loop cannibalization [2020-07-01 11:14:29,704 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 23 loop predicates [2020-07-01 11:14:29,704 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 167 states and 196 transitions. cyclomatic complexity: 31 Second operand 12 states. [2020-07-01 11:14:41,429 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 167 states and 196 transitions. cyclomatic complexity: 31. Second operand 12 states. Result 340972 states and 396108 transitions. Complement of second has 56639 states. [2020-07-01 11:14:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 71 states 1 stem states 68 non-accepting loop states 1 accepting loop states [2020-07-01 11:14:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 11:14:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 311 transitions. [2020-07-01 11:14:41,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 311 transitions. Stem has 3 letters. Loop has 64 letters. [2020-07-01 11:14:41,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:41,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 311 transitions. Stem has 67 letters. Loop has 64 letters. [2020-07-01 11:14:41,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:41,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 311 transitions. Stem has 3 letters. Loop has 128 letters. [2020-07-01 11:14:41,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:14:41,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340972 states and 396108 transitions. [2020-07-01 11:14:42,734 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 740 [2020-07-01 11:14:42,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340972 states to 1900 states and 2048 transitions. [2020-07-01 11:14:42,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2020-07-01 11:14:42,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2020-07-01 11:14:42,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1900 states and 2048 transitions. [2020-07-01 11:14:42,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:14:42,746 INFO L688 BuchiCegarLoop]: Abstraction has 1900 states and 2048 transitions. [2020-07-01 11:14:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states and 2048 transitions. [2020-07-01 11:14:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 225. [2020-07-01 11:14:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-07-01 11:14:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 258 transitions. [2020-07-01 11:14:42,757 INFO L711 BuchiCegarLoop]: Abstraction has 225 states and 258 transitions. [2020-07-01 11:14:42,757 INFO L591 BuchiCegarLoop]: Abstraction has 225 states and 258 transitions. [2020-07-01 11:14:42,757 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2020-07-01 11:14:42,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 258 transitions. [2020-07-01 11:14:42,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 174 [2020-07-01 11:14:42,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:14:42,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:14:42,759 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:14:42,759 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 9, 8, 1, 1] [2020-07-01 11:14:42,759 INFO L794 eck$LassoCheckResult]: Stem: 778335#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 778336#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778350#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778362#L12-2 [2020-07-01 11:14:42,760 INFO L796 eck$LassoCheckResult]: Loop: 778362#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778525#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778523#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778521#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778519#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778513#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778512#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778511#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778510#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778487#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778450#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778449#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 778448#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778446#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778445#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778443#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778441#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778440#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778439#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778438#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778437#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778436#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778435#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778428#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778427#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778426#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778425#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778424#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778423#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778422#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778421#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778420#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778419#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778418#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778417#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778416#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778415#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778414#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778413#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778412#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778411#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778410#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778409#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778408#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778407#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778399#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778404#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778405#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778333#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 778334#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778339#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778340#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778347#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778434#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778433#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778432#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778429#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778431#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778337#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778338#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778341#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778387#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778543#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778542#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778538#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 778534#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 778533#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 778532#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 778362#L12-2 [2020-07-01 11:14:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash 67633, now seen corresponding path program 5 times [2020-07-01 11:14:42,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:42,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696920124] [2020-07-01 11:14:42,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:42,766 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:42,766 INFO L82 PathProgramCache]: Analyzing trace with hash 773083243, now seen corresponding path program 16 times [2020-07-01 11:14:42,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:42,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720845996] [2020-07-01 11:14:42,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:42,784 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1990442853, now seen corresponding path program 8 times [2020-07-01 11:14:42,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:14:42,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019935291] [2020-07-01 11:14:42,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:14:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:42,803 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:14:43,079 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 63 [2020-07-01 11:14:43,087 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:43,087 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:43,088 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:43,088 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:43,088 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 11:14:43,088 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:43,088 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:43,088 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:43,088 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration22_Loop [2020-07-01 11:14:43,088 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:43,088 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:43,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 11:14:43,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:43,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:43,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:43,146 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:43,147 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:43,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 11:14:43,151 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:14:43,187 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 11:14:43,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 11:14:43,192 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 11:14:43,221 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:14:43,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:14:43,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:14:43,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:14:43,222 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:14:43,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:43,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:14:43,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:14:43,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration22_Loop [2020-07-01 11:14:43,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:14:43,222 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:14:43,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:43,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:43,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:14:43,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 11:14:43,290 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:14:43,290 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:43,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:14:43,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:14:43,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:14:43,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:14:43,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:14:43,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:14:43,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:14:43,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:14:43,299 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:14:43,302 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 11:14:43,302 INFO L444 ModelExtractionUtils]: 0 out of 3 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 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:14:43,305 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:14:43,305 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 11:14:43,306 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:14:43,306 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2020-07-01 11:14:43,335 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 11:14:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:14:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:43,350 INFO L264 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 11:14:43,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:43,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:43,364 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 159 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-07-01 11:14:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:43,581 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:43,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:43,729 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:43,730 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:43,793 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:43,793 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:43,813 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:43,814 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:43,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:43,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,027 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,116 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,137 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,479 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,480 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,498 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,517 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,535 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,572 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,572 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,590 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,608 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,609 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,627 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,719 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,738 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,756 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,775 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,793 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,850 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,868 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,869 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,888 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,906 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,943 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,962 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,962 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,980 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:44,981 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:44,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:45,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,018 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:45,036 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:45,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:45,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:45,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,094 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:45,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:45,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:45,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,561 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,575 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,589 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,603 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,617 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,631 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,645 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,659 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,673 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,687 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,701 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,715 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,729 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,743 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,757 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,771 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:14:45,785 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 11:14:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:45,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:14:45,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 11:14:45,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:14:45,828 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 24 predicates after loop cannibalization [2020-07-01 11:14:45,828 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 24 loop predicates [2020-07-01 11:14:45,828 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 225 states and 258 transitions. cyclomatic complexity: 35 Second operand 13 states. [2020-07-01 11:15:01,827 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 12 [2020-07-01 11:15:20,140 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 225 states and 258 transitions. cyclomatic complexity: 35. Second operand 13 states. Result 770092 states and 882514 transitions. Complement of second has 171018 states. [2020-07-01 11:15:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 119 states 1 stem states 112 non-accepting loop states 5 accepting loop states [2020-07-01 11:15:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 11:15:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 470 transitions. [2020-07-01 11:15:20,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 119 states and 470 transitions. Stem has 3 letters. Loop has 68 letters. [2020-07-01 11:15:20,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:15:20,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 119 states and 470 transitions. Stem has 71 letters. Loop has 68 letters. [2020-07-01 11:15:20,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:15:20,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 119 states and 470 transitions. Stem has 3 letters. Loop has 136 letters. [2020-07-01 11:15:20,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:15:20,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 770092 states and 882514 transitions. [2020-07-01 11:15:27,184 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 843 [2020-07-01 11:15:27,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 770092 states to 2291 states and 2433 transitions. [2020-07-01 11:15:27,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 412 [2020-07-01 11:15:27,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1732 [2020-07-01 11:15:27,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2291 states and 2433 transitions. [2020-07-01 11:15:27,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 11:15:27,197 INFO L688 BuchiCegarLoop]: Abstraction has 2291 states and 2433 transitions. [2020-07-01 11:15:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states and 2433 transitions. [2020-07-01 11:15:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 340. [2020-07-01 11:15:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-07-01 11:15:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 377 transitions. [2020-07-01 11:15:27,210 INFO L711 BuchiCegarLoop]: Abstraction has 340 states and 377 transitions. [2020-07-01 11:15:27,210 INFO L591 BuchiCegarLoop]: Abstraction has 340 states and 377 transitions. [2020-07-01 11:15:27,210 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2020-07-01 11:15:27,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 340 states and 377 transitions. [2020-07-01 11:15:27,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 243 [2020-07-01 11:15:27,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:15:27,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:15:27,212 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 11:15:27,212 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2020-07-01 11:15:27,212 INFO L794 eck$LassoCheckResult]: Stem: 1730018#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1730019#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730033#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730042#L12-2 [2020-07-01 11:15:27,213 INFO L796 eck$LassoCheckResult]: Loop: 1730042#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730228#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730227#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730226#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730225#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730224#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730223#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730222#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730221#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730219#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730218#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730217#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 1) (= 1 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1730216#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730215#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730128#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730127#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730125#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730124#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730123#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730122#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730121#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730120#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730119#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730118#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730117#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730116#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730115#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730114#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730113#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730112#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730111#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730110#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730109#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730108#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730107#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730106#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730105#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730104#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730103#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730102#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730101#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730097#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730096#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730095#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730094#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730093#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730091#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730029#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730030#L12-2 [36] L12-2-->L15-1: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1730066#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730022#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730023#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730087#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730088#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730256#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730255#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730254#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730253#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730252#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730251#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730242#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730240#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730239#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730238#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730236#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730070#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730234#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730233#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730232#L12-2 [55] L12-2-->L15-1: Formula: (> 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1730231#L15-1 [57] L15-1-->L18-1: Formula: (and (> 1 v_ULTIMATE.start_main_~up~0_9) (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1)))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1730230#L18-1 [41] L18-1-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1730229#L12 [53] L12-->L12-2: Formula: (< 1 v_ULTIMATE.start_main_~i~0_9) 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_9} AuxVars[] AssignedVars[] 1730042#L12-2 [2020-07-01 11:15:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:15:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash 67633, now seen corresponding path program 6 times [2020-07-01 11:15:27,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:15:27,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063317017] [2020-07-01 11:15:27,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:15:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:15:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:15:27,217 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:15:27,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:15:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1902771833, now seen corresponding path program 17 times [2020-07-01 11:15:27,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:15:27,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577928351] [2020-07-01 11:15:27,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:15:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:15:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:15:27,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:15:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:15:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash 165566121, now seen corresponding path program 9 times [2020-07-01 11:15:27,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:15:27,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071043165] [2020-07-01 11:15:27,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:15:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:15:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:15:27,254 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:15:27,565 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 66 [2020-07-01 11:15:27,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:15:27 BasicIcfg [2020-07-01 11:15:27,613 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 11:15:27,615 INFO L168 Benchmark]: Toolchain (without parser) took 94808.12 ms. Allocated memory was 514.9 MB in the beginning and 7.7 GB in the end (delta: 7.2 GB). Free memory was 435.9 MB in the beginning and 5.2 GB in the end (delta: -4.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 50.3 GB. [2020-07-01 11:15:27,615 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:15:27,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.45 ms. Allocated memory was 514.9 MB in the beginning and 563.6 MB in the end (delta: 48.8 MB). Free memory was 435.9 MB in the beginning and 533.4 MB in the end (delta: -97.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:15:27,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.95 ms. Allocated memory is still 563.6 MB. Free memory was 533.4 MB in the beginning and 531.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-07-01 11:15:27,616 INFO L168 Benchmark]: Boogie Preprocessor took 19.77 ms. Allocated memory is still 563.6 MB. Free memory was 531.7 MB in the beginning and 530.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 11:15:27,617 INFO L168 Benchmark]: RCFGBuilder took 235.31 ms. Allocated memory is still 563.6 MB. Free memory was 530.1 MB in the beginning and 518.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:15:27,617 INFO L168 Benchmark]: BlockEncodingV2 took 76.25 ms. Allocated memory is still 563.6 MB. Free memory was 518.8 MB in the beginning and 512.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 50.3 GB. [2020-07-01 11:15:27,617 INFO L168 Benchmark]: TraceAbstraction took 147.36 ms. Allocated memory is still 563.6 MB. Free memory was 512.7 MB in the beginning and 504.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 50.3 GB. [2020-07-01 11:15:27,618 INFO L168 Benchmark]: BuchiAutomizer took 93988.85 ms. Allocated memory was 563.6 MB in the beginning and 7.7 GB in the end (delta: 7.1 GB). Free memory was 503.5 MB in the beginning and 5.2 GB in the end (delta: -4.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 50.3 GB. [2020-07-01 11:15:27,620 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 9 locations, 13 edges - StatisticsResult: Encoded RCFG 5 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 299.45 ms. Allocated memory was 514.9 MB in the beginning and 563.6 MB in the end (delta: 48.8 MB). Free memory was 435.9 MB in the beginning and 533.4 MB in the end (delta: -97.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.95 ms. Allocated memory is still 563.6 MB. Free memory was 533.4 MB in the beginning and 531.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.77 ms. Allocated memory is still 563.6 MB. Free memory was 531.7 MB in the beginning and 530.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 235.31 ms. Allocated memory is still 563.6 MB. Free memory was 530.1 MB in the beginning and 518.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 76.25 ms. Allocated memory is still 563.6 MB. Free memory was 518.8 MB in the beginning and 512.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 147.36 ms. Allocated memory is still 563.6 MB. Free memory was 512.7 MB in the beginning and 504.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 93988.85 ms. Allocated memory was 563.6 MB in the beginning and 7.7 GB in the end (delta: 7.1 GB). Free memory was 503.5 MB in the beginning and 5.2 GB in the end (delta: -4.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 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=5occurred 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 25 terminating modules (13 trivial, 0 deterministic, 12 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function -2 * i + 19 and consists of 9 locations. One nondeterministic module has affine ranking function -2 * i + 19 and consists of 5 locations. One nondeterministic module has affine ranking function i and consists of 7 locations. One nondeterministic module has affine ranking function -1 * i + 5 and consists of 16 locations. One nondeterministic module has affine ranking function -2 * i + 9 and consists of 26 locations. One nondeterministic module has affine ranking function -1 * i + 4 and consists of 38 locations. One nondeterministic module has affine ranking function -2 * i + 7 and consists of 41 locations. One nondeterministic module has affine ranking function -1 * i + 6 and consists of 68 locations. One nondeterministic module has affine ranking function -2 * i + 11 and consists of 61 locations. One nondeterministic module has affine ranking function -1 * i + 5 and consists of 71 locations. One nondeterministic module has affine ranking function -2 * i + 9 and consists of 119 locations. 13 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 340 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 93.9s and 23 iterations. TraceHistogramMax:18. Analysis of lassos took 8.8s. Construction of modules took 3.2s. Büchi inclusion checks took 72.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 25. Automata minimization 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 8487 StatesRemovedByMinimization, 24 NontrivialMinimizations. Non-live state removal took 9.4s Buchi closure took 0.0s. Biggest automaton had 340 states and ocurred in iteration 22. Nontrivial modules had stage [12, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2158/2784 HoareTripleCheckerStatistics: 122 SDtfs, 2520 SDslu, 28 SDs, 0 SdLazy, 3299 SolverSat, 1321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT9 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax191 hnf100 lsp35 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf113 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 12 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@150901f1=0, \result=0, i=4} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) Loop: [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-07-01 11:13:49.548 ----------------------------------------------- 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_PSiMzm/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:15:29.864 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check