./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:11:04,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:11:04,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:11:04,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:11:04,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:11:04,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:11:04,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:11:04,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:11:04,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:11:04,574 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:11:04,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:11:04,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:11:04,575 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:11:04,578 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:11:04,578 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:11:04,578 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:11:04,579 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:11:04,579 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:11:04,579 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:11:04,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:11:04,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:11:04,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:11:04,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:11:04,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:11:04,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:11:04,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:11:04,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:11:04,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:11:04,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:11:04,586 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:11:04,587 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:11:04,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:11:04,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:11:04,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:11:04,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:11:04,588 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:11:04,588 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 [2024-10-15 00:11:04,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:11:04,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:11:04,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:11:04,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:11:04,949 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:11:04,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-10-15 00:11:06,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:11:06,756 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:11:06,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-10-15 00:11:06,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282c1eaf8/8531e151a6d34b37bec0b0bfa48c8c2b/FLAG32d22683e [2024-10-15 00:11:07,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282c1eaf8/8531e151a6d34b37bec0b0bfa48c8c2b [2024-10-15 00:11:07,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:11:07,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:11:07,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:11:07,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:11:07,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:11:07,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a186efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07, skipping insertion in model container [2024-10-15 00:11:07,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:11:07,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:11:07,397 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:11:07,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:11:07,442 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:11:07,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07 WrapperNode [2024-10-15 00:11:07,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:11:07,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:11:07,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:11:07,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:11:07,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,472 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-10-15 00:11:07,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:11:07,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:11:07,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:11:07,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:11:07,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,492 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-15 00:11:07,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:11:07,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:11:07,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:11:07,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:11:07,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2024-10-15 00:11:07,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:07,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:07,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:07,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:11:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:11:07,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:11:07,673 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:11:07,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:11:07,737 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-10-15 00:11:07,739 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:11:07,751 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:11:07,751 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 00:11:07,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:07 BoogieIcfgContainer [2024-10-15 00:11:07,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:11:07,753 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:11:07,753 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:11:07,757 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:11:07,759 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:11:07,759 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:11:07" (1/3) ... [2024-10-15 00:11:07,761 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5858e7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:11:07, skipping insertion in model container [2024-10-15 00:11:07,761 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:11:07,761 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (2/3) ... [2024-10-15 00:11:07,762 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5858e7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:11:07, skipping insertion in model container [2024-10-15 00:11:07,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:11:07,763 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:07" (3/3) ... [2024-10-15 00:11:07,766 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2024-10-15 00:11:07,831 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:11:07,831 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:11:07,832 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:11:07,832 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:11:07,832 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:11:07,832 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:11:07,832 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:11:07,832 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:11:07,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:07,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:11:07,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:07,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:07,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:11:07,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:11:07,859 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:11:07,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:07,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:11:07,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:07,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:07,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:11:07,862 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:11:07,870 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4#L18-1true [2024-10-15 00:11:07,871 INFO L747 eck$LassoCheckResult]: Loop: 4#L18-1true assume !!(main_~i~0#1 > 0); 10#L12true assume !(1 == main_~i~0#1); 2#L12-2true assume 10 == main_~i~0#1;main_~up~0#1 := 0; 7#L15-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4#L18-1true [2024-10-15 00:11:07,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:11:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:07,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484960943] [2024-10-15 00:11:07,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:07,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:08,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:08,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-10-15 00:11:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:08,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483042832] [2024-10-15 00:11:08,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:08,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:08,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483042832] [2024-10-15 00:11:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483042832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:08,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:08,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:11:08,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545438956] [2024-10-15 00:11:08,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:08,144 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:11:08,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:08,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:11:08,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:11:08,184 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:08,214 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2024-10-15 00:11:08,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2024-10-15 00:11:08,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:11:08,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 10 states and 15 transitions. [2024-10-15 00:11:08,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-15 00:11:08,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-15 00:11:08,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2024-10-15 00:11:08,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:11:08,225 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-10-15 00:11:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2024-10-15 00:11:08,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-15 00:11:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2024-10-15 00:11:08,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-10-15 00:11:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:11:08,261 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-10-15 00:11:08,262 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:11:08,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2024-10-15 00:11:08,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:11:08,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:08,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:08,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:11:08,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:11:08,264 INFO L745 eck$LassoCheckResult]: Stem: 40#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 41#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 42#L18-1 [2024-10-15 00:11:08,264 INFO L747 eck$LassoCheckResult]: Loop: 42#L18-1 assume !!(main_~i~0#1 > 0); 44#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 35#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 36#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 42#L18-1 [2024-10-15 00:11:08,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-15 00:11:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:08,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974790032] [2024-10-15 00:11:08,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:08,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:08,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:08,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:08,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2024-10-15 00:11:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:08,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414623758] [2024-10-15 00:11:08,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:08,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:08,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414623758] [2024-10-15 00:11:08,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414623758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:08,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:08,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:11:08,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259742588] [2024-10-15 00:11:08,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:08,336 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:11:08,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:08,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:11:08,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:11:08,338 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:08,376 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2024-10-15 00:11:08,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2024-10-15 00:11:08,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:11:08,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2024-10-15 00:11:08,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:11:08,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:11:08,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2024-10-15 00:11:08,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:11:08,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-15 00:11:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2024-10-15 00:11:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-15 00:11:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2024-10-15 00:11:08,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-15 00:11:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:11:08,386 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-15 00:11:08,387 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:11:08,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2024-10-15 00:11:08,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:11:08,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:08,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:08,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:11:08,390 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:11:08,390 INFO L745 eck$LassoCheckResult]: Stem: 69#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 70#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 72#L18-1 [2024-10-15 00:11:08,390 INFO L747 eck$LassoCheckResult]: Loop: 72#L18-1 assume !!(main_~i~0#1 > 0); 77#L12 assume !(1 == main_~i~0#1); 76#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 71#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 72#L18-1 [2024-10-15 00:11:08,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-15 00:11:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:08,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970618510] [2024-10-15 00:11:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:08,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:08,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:08,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:08,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2024-10-15 00:11:08,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:08,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259581013] [2024-10-15 00:11:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:08,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:08,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:08,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2024-10-15 00:11:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520310039] [2024-10-15 00:11:08,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:08,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:08,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:08,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:08,541 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:08,541 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:08,542 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:08,542 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:08,542 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:08,542 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:08,542 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:08,542 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:08,542 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2024-10-15 00:11:08,543 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:08,543 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:08,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:08,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:08,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:08,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:08,681 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:08,682 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:08,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:08,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:08,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:08,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:11:08,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:08,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:08,726 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:08,726 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:08,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:08,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:08,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:08,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:08,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:11:08,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:08,749 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:08,772 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:08,773 INFO L401 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: [] [2024-10-15 00:11:08,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:08,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:08,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:08,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:08,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:11:08,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:08,798 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:08,820 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:08,821 INFO L401 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: [] [2024-10-15 00:11:08,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 00:11:08,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:08,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:08,837 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:08,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:11:08,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:08,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:08,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:08,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:08,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:08,873 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:08,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:11:08,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:08,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:08,898 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:08,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 00:11:08,914 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:08,914 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:08,914 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:08,914 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:08,914 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:08,914 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:08,915 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:08,915 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:08,915 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2024-10-15 00:11:08,915 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:08,915 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:08,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:08,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:08,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:08,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:08,993 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:08,998 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:08,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:09,001 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:09,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:11:09,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:09,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:09,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:09,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:09,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:09,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:09,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:09,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:09,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:09,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:09,059 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:09,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:11:09,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:09,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:09,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:09,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:09,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:09,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:09,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:09,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:09,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 00:11:09,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:09,105 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:09,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 00:11:09,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:09,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:09,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:09,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:09,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:09,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:09,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:11:09,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:09,160 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:09,164 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:11:09,164 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-15 00:11:09,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:09,191 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:09,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:11:09,193 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:09,194 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:11:09,194 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:09,194 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-15 00:11:09,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 00:11:09,215 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:11:09,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:09,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:09,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:09,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:11:09,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:09,311 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:11:09,313 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:09,375 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 51 transitions. Complement of second has 7 states. [2024-10-15 00:11:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-15 00:11:09,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-15 00:11:09,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:09,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-15 00:11:09,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:09,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2024-10-15 00:11:09,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:09,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2024-10-15 00:11:09,383 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2024-10-15 00:11:09,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2024-10-15 00:11:09,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-15 00:11:09,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-15 00:11:09,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2024-10-15 00:11:09,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:09,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2024-10-15 00:11:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2024-10-15 00:11:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-10-15 00:11:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-10-15 00:11:09,387 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-10-15 00:11:09,387 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-10-15 00:11:09,387 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:11:09,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2024-10-15 00:11:09,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-10-15 00:11:09,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:09,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:09,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:11:09,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:11:09,389 INFO L745 eck$LassoCheckResult]: Stem: 164#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 165#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 167#L18-1 assume !!(main_~i~0#1 > 0); 161#L12 [2024-10-15 00:11:09,389 INFO L747 eck$LassoCheckResult]: Loop: 161#L12 assume !(1 == main_~i~0#1); 177#L12-2 assume !(10 == main_~i~0#1); 166#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 160#L18-1 assume !!(main_~i~0#1 > 0); 161#L12 [2024-10-15 00:11:09,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:09,389 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-10-15 00:11:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:09,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045088641] [2024-10-15 00:11:09,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:09,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:09,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:09,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:09,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:09,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2024-10-15 00:11:09,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:09,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386268596] [2024-10-15 00:11:09,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:09,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:09,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:09,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:09,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2024-10-15 00:11:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:09,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426946272] [2024-10-15 00:11:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:09,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:09,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:09,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:09,453 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:09,454 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:09,454 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:09,454 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:09,454 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:09,454 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,454 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:09,454 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:09,455 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-10-15 00:11:09,455 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:09,455 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:09,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:09,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:09,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:09,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:09,568 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:09,568 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:09,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:09,570 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:09,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:11:09,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:09,573 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:09,595 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:09,595 INFO L401 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: [] [2024-10-15 00:11:09,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:09,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:09,617 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:09,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 00:11:09,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:09,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:09,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:09,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:09,651 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:09,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 00:11:09,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:09,654 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:09,730 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:09,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:09,737 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:09,737 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:09,737 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:09,737 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:09,737 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:09,737 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,737 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:09,737 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:09,737 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-10-15 00:11:09,737 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:09,737 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:09,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:09,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:09,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:09,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:09,844 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:09,844 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:09,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:09,847 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:09,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-15 00:11:09,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:09,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:09,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:09,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:09,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:09,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:09,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:09,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:09,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:09,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:09,886 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:09,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-15 00:11:09,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:09,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:09,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:09,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:09,901 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 00:11:09,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:09,903 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-15 00:11:09,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:09,910 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:09,913 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-15 00:11:09,913 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:11:09,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:09,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:09,915 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:09,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-15 00:11:09,917 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:09,917 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:11:09,918 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:09,918 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-15 00:11:09,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 00:11:09,933 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:11:09,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:09,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:09,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:09,963 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:11:09,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:10,012 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:11:10,012 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:10,045 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 59 transitions. Complement of second has 7 states. [2024-10-15 00:11:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-15 00:11:10,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-15 00:11:10,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:10,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2024-10-15 00:11:10,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:10,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2024-10-15 00:11:10,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:10,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2024-10-15 00:11:10,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:11:10,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2024-10-15 00:11:10,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-15 00:11:10,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-15 00:11:10,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2024-10-15 00:11:10,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:10,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-15 00:11:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2024-10-15 00:11:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-15 00:11:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2024-10-15 00:11:10,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-15 00:11:10,059 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-15 00:11:10,060 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:11:10,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2024-10-15 00:11:10,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:11:10,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:10,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:10,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:11:10,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:11:10,061 INFO L745 eck$LassoCheckResult]: Stem: 273#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 277#L18-1 assume !!(main_~i~0#1 > 0); 280#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 281#L12-2 assume !(10 == main_~i~0#1); 287#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 288#L18-1 [2024-10-15 00:11:10,061 INFO L747 eck$LassoCheckResult]: Loop: 288#L18-1 assume !!(main_~i~0#1 > 0); 295#L12 assume !(1 == main_~i~0#1); 289#L12-2 assume !(10 == main_~i~0#1); 290#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 288#L18-1 [2024-10-15 00:11:10,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2024-10-15 00:11:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538191727] [2024-10-15 00:11:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:10,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:10,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:10,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:10,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2024-10-15 00:11:10,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:10,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027350149] [2024-10-15 00:11:10,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:10,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:10,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:10,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:10,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2024-10-15 00:11:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:10,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198253124] [2024-10-15 00:11:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:10,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:10,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:10,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:10,131 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:10,131 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:10,131 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:10,131 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:10,132 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:10,132 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,132 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:10,132 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:10,132 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2024-10-15 00:11:10,132 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:10,132 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:10,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,246 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:10,246 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:10,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,250 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-15 00:11:10,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:10,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:10,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,287 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-15 00:11:10,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:10,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,332 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:10,332 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=14} Honda state: {ULTIMATE.start_main_~i~0#1=14} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=1}, {ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=0}] Lambdas: [1, 17, 6] Nus: [1, 0] [2024-10-15 00:11:10,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:10,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,353 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-15 00:11:10,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:10,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,379 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:10,380 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:10,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-15 00:11:10,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,400 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-15 00:11:10,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:10,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,420 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:10,420 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:10,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-15 00:11:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,441 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-15 00:11:10,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:10,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,475 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:10,475 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:10,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:10,522 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:10,522 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:10,522 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:10,523 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:10,523 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:10,523 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,523 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:10,523 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:10,523 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2024-10-15 00:11:10,523 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:10,523 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:10,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,643 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:10,644 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:10,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,649 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-15 00:11:10,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:10,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,671 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:10,671 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:10,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:10,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,688 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-15 00:11:10,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:10,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,709 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:10,709 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res#1=0} Honda state: {ULTIMATE.start_main_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:10,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:10,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,728 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-15 00:11:10,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:10,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,754 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:10,754 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_6=1} Honda state: {v_rep~unnamed0~0~true_6=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:10,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:10,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,773 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-15 00:11:10,776 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:10,776 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,791 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:10,791 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0#1=0} Honda state: {ULTIMATE.start_main_#t~nondet0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:10,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:10,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,809 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-15 00:11:10,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:10,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:10,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:10,846 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:10,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-15 00:11:10,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:10,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:10,889 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:10,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-15 00:11:10,896 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:10,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:10,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:10,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:10,896 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:10,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:10,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:10,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:10,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2024-10-15 00:11:10,897 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:10,897 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:10,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:10,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-15 00:11:10,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-15 00:11:11,073 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:11,073 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:11,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:11,078 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:11,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-15 00:11:11,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:11,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:11,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:11,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:11,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:11,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:11,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:11,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:11,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-15 00:11:11,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:11,130 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:11,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-15 00:11:11,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:11,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:11,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:11,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:11,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:11,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:11,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:11:11,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:11,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:11,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-15 00:11:11,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:11,167 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:11,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-15 00:11:11,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:11,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:11,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:11,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:11,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:11,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:11,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:11,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:11,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:11,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:11,213 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:11,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-15 00:11:11,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:11,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:11,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:11,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:11,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:11,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:11,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:11:11,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:11,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:11,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:11,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:11,249 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:11,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-15 00:11:11,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:11,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:11,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:11,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:11,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:11,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:11,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:11,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:11,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-15 00:11:11,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:11,291 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:11,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-15 00:11:11,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:11,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:11,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:11,307 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 00:11:11,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:11,317 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-15 00:11:11,318 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-15 00:11:11,331 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:11,361 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-15 00:11:11,361 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-15 00:11:11,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:11,364 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:11,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-15 00:11:11,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:11,381 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-10-15 00:11:11,381 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:11,381 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0#1 + 10 >= 0] [2024-10-15 00:11:11,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:11,402 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-10-15 00:11:11,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:11,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:11:11,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:11,475 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:11:11,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:11,518 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-15 00:11:11,518 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:11,603 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 68 transitions. Complement of second has 8 states. [2024-10-15 00:11:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-10-15 00:11:11,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-15 00:11:11,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:11,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-15 00:11:11,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:11,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2024-10-15 00:11:11,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:11,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2024-10-15 00:11:11,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:11:11,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2024-10-15 00:11:11,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-15 00:11:11,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-15 00:11:11,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2024-10-15 00:11:11,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:11,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-15 00:11:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2024-10-15 00:11:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-10-15 00:11:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2024-10-15 00:11:11,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 64 transitions. [2024-10-15 00:11:11,620 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2024-10-15 00:11:11,620 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:11:11,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2024-10-15 00:11:11,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:11:11,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:11,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:11,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:11:11,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:11:11,622 INFO L745 eck$LassoCheckResult]: Stem: 416#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 417#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 420#L18-1 assume !!(main_~i~0#1 > 0); 429#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 426#L12-2 assume !(10 == main_~i~0#1); 425#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 424#L18-1 assume !!(main_~i~0#1 > 0); 421#L12 assume !(1 == main_~i~0#1); 422#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 447#L15-1 [2024-10-15 00:11:11,622 INFO L747 eck$LassoCheckResult]: Loop: 447#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 446#L18-1 assume !!(main_~i~0#1 > 0); 444#L12 assume !(1 == main_~i~0#1); 445#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 447#L15-1 [2024-10-15 00:11:11,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:11,624 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2024-10-15 00:11:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:11,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612815407] [2024-10-15 00:11:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:11,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612815407] [2024-10-15 00:11:11,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612815407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:11:11,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118421883] [2024-10-15 00:11:11,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:11,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:11:11,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:11,691 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:11:11,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-10-15 00:11:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:11,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 00:11:11,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:11,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:11:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118421883] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:11:11,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:11:11,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-15 00:11:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819102954] [2024-10-15 00:11:11,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:11:11,766 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:11:11,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2024-10-15 00:11:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:11,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913825122] [2024-10-15 00:11:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:11,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:11,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:11,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:11,800 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:11,800 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:11,800 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:11,800 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:11,801 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:11,801 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,801 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:11,801 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:11,801 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2024-10-15 00:11:11,801 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:11,801 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:11,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:11,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:11,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:11,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:11,862 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:11,863 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:11,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:11,865 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:11,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-15 00:11:11,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:11,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:11,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:11,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:11,900 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:11,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-15 00:11:11,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:11,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:11,918 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:11,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-15 00:11:11,934 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:11,934 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:11,935 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:11,935 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:11,935 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:11,935 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:11,935 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:11,935 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:11,935 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2024-10-15 00:11:11,935 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:11,935 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:11,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:11,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:11,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:11,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:11,999 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:12,000 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:12,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:12,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:12,002 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:12,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-15 00:11:12,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:12,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:12,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:12,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:12,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:12,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:12,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:11:12,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:12,022 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:12,025 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-15 00:11:12,025 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:11:12,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:12,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:12,027 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:12,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-15 00:11:12,029 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:12,029 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:11:12,030 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:12,030 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-15 00:11:12,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-15 00:11:12,047 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:11:12,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:12,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:12,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:12,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:11:12,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:12,115 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:11:12,115 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:12,150 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 105 states and 160 transitions. Complement of second has 7 states. [2024-10-15 00:11:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-15 00:11:12,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-15 00:11:12,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:12,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2024-10-15 00:11:12,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:12,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2024-10-15 00:11:12,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:12,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2024-10-15 00:11:12,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-15 00:11:12,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2024-10-15 00:11:12,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-15 00:11:12,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-10-15 00:11:12,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2024-10-15 00:11:12,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:12,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-10-15 00:11:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2024-10-15 00:11:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-10-15 00:11:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.548780487804878) internal successors, (127), 81 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-15 00:11:12,175 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-15 00:11:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 00:11:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-15 00:11:12,176 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:12,227 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2024-10-15 00:11:12,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2024-10-15 00:11:12,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-10-15 00:11:12,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2024-10-15 00:11:12,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2024-10-15 00:11:12,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-10-15 00:11:12,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2024-10-15 00:11:12,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:12,237 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 239 transitions. [2024-10-15 00:11:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2024-10-15 00:11:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2024-10-15 00:11:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.5220588235294117) internal successors, (207), 135 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2024-10-15 00:11:12,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-10-15 00:11:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:11:12,250 INFO L425 stractBuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-10-15 00:11:12,251 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:11:12,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2024-10-15 00:11:12,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-10-15 00:11:12,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:12,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:12,254 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2024-10-15 00:11:12,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:11:12,254 INFO L745 eck$LassoCheckResult]: Stem: 918#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 919#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 922#L18-1 assume !!(main_~i~0#1 > 0); 933#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 931#L12-2 assume !(10 == main_~i~0#1); 926#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 927#L18-1 assume !!(main_~i~0#1 > 0); 1005#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 979#L12-2 assume !(10 == main_~i~0#1); 1007#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 985#L18-1 [2024-10-15 00:11:12,254 INFO L747 eck$LassoCheckResult]: Loop: 985#L18-1 assume !!(main_~i~0#1 > 0); 995#L12 assume !(1 == main_~i~0#1); 968#L12-2 assume !(10 == main_~i~0#1); 990#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 985#L18-1 [2024-10-15 00:11:12,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2024-10-15 00:11:12,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:12,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475656745] [2024-10-15 00:11:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:12,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:12,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:12,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475656745] [2024-10-15 00:11:12,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475656745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:12,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:12,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:11:12,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107430175] [2024-10-15 00:11:12,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:12,317 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:11:12,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2024-10-15 00:11:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831173540] [2024-10-15 00:11:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:12,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:12,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:12,358 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:12,358 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:12,358 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:12,358 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:12,359 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:12,359 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:12,359 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:12,359 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:12,359 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-10-15 00:11:12,359 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:12,359 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:12,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:12,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:12,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:12,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:12,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-15 00:11:12,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-10-15 00:11:12,492 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:12,492 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:12,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:12,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:12,495 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:12,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-15 00:11:12,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:12,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:12,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:12,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:12,532 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:12,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-15 00:11:12,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:12,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:12,580 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:12,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-15 00:11:12,586 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:12,586 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:12,586 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:12,586 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:12,587 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:12,587 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:12,587 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:12,587 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:12,587 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-10-15 00:11:12,587 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:12,587 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:12,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:12,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:12,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:12,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:12,682 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:12,683 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:12,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:12,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:12,685 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:12,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-15 00:11:12,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:12,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:12,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:12,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:12,700 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 00:11:12,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:12,701 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-15 00:11:12,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:12,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:12,707 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-15 00:11:12,707 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:11:12,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:12,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:12,710 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:12,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-15 00:11:12,712 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:12,712 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:11:12,712 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:12,712 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-15 00:11:12,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-15 00:11:12,728 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:11:12,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:12,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:12,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:12,768 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:11:12,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:12,794 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:11:12,795 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:12,818 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 248 states and 381 transitions. Complement of second has 5 states. [2024-10-15 00:11:12,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-15 00:11:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-15 00:11:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-15 00:11:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-15 00:11:12,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:12,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2024-10-15 00:11:12,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-10-15 00:11:12,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2024-10-15 00:11:12,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2024-10-15 00:11:12,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2024-10-15 00:11:12,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2024-10-15 00:11:12,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:12,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224 states and 333 transitions. [2024-10-15 00:11:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2024-10-15 00:11:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2024-10-15 00:11:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 1.504950495049505) internal successors, (304), 201 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2024-10-15 00:11:12,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 304 transitions. [2024-10-15 00:11:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:12,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:11:12,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:11:12,848 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:12,874 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2024-10-15 00:11:12,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2024-10-15 00:11:12,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2024-10-15 00:11:12,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2024-10-15 00:11:12,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2024-10-15 00:11:12,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-10-15 00:11:12,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2024-10-15 00:11:12,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:12,880 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 313 transitions. [2024-10-15 00:11:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2024-10-15 00:11:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2024-10-15 00:11:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 200 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2024-10-15 00:11:12,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-10-15 00:11:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:11:12,897 INFO L425 stractBuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-10-15 00:11:12,897 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:11:12,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2024-10-15 00:11:12,898 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-10-15 00:11:12,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:12,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:12,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-15 00:11:12,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:11:12,899 INFO L745 eck$LassoCheckResult]: Stem: 1796#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1797#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1800#L18-1 assume !!(main_~i~0#1 > 0); 1816#L12 assume !(1 == main_~i~0#1); 1819#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 1818#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1814#L18-1 assume !!(main_~i~0#1 > 0); 1815#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 1940#L12-2 assume !(10 == main_~i~0#1); 1824#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1803#L18-1 assume !!(main_~i~0#1 > 0); 1804#L12 assume !(1 == main_~i~0#1); 1986#L12-2 assume !(10 == main_~i~0#1); 1807#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1791#L18-1 [2024-10-15 00:11:12,899 INFO L747 eck$LassoCheckResult]: Loop: 1791#L18-1 assume !!(main_~i~0#1 > 0); 1792#L12 assume !(1 == main_~i~0#1); 1801#L12-2 assume !(10 == main_~i~0#1); 1808#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1791#L18-1 [2024-10-15 00:11:12,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:12,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1454758974, now seen corresponding path program 1 times [2024-10-15 00:11:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179239213] [2024-10-15 00:11:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:11:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179239213] [2024-10-15 00:11:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179239213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:12,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:11:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041272196] [2024-10-15 00:11:12,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:12,944 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:11:12,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:12,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2024-10-15 00:11:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:12,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986414375] [2024-10-15 00:11:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:12,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:12,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:12,996 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:12,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:12,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:12,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:12,997 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:12,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:12,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:12,998 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:12,998 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-10-15 00:11:12,998 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:12,998 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:12,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:13,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:13,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:13,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:13,092 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:13,092 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:13,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:13,094 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:13,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-15 00:11:13,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:13,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:13,125 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:13,125 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:13,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-15 00:11:13,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:13,143 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:13,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-15 00:11:13,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:13,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:13,171 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:13,172 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=4} Honda state: {ULTIMATE.start_main_~up~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:13,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-15 00:11:13,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:13,187 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:13,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-15 00:11:13,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:13,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:13,210 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:13,210 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_12=0} Honda state: {v_rep~unnamed0~0~false_12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:13,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-15 00:11:13,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:13,227 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:13,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-15 00:11:13,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:13,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:13,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:13,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:13,257 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:13,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-15 00:11:13,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:13,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:13,301 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:13,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:13,307 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:13,307 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:13,307 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:13,307 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:13,307 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:13,308 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,308 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:13,308 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:13,308 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-10-15 00:11:13,308 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:13,308 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:13,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:13,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:13,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:13,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:13,410 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:13,410 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:13,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:13,412 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:13,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-15 00:11:13,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:13,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:13,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:13,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:13,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:13,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:13,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:13,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:13,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:13,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:13,452 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:13,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-15 00:11:13,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:13,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:13,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:13,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:13,470 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 00:11:13,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:13,471 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-15 00:11:13,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:13,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:13,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:13,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:13,489 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:13,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-15 00:11:13,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:13,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:13,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:13,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:13,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:13,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:13,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:13,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:13,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:13,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:13,531 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:13,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-15 00:11:13,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:13,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:13,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:13,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:13,545 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 00:11:13,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:13,547 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-15 00:11:13,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:13,550 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:13,553 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-15 00:11:13,553 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:11:13,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:13,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:13,555 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:13,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-15 00:11:13,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:13,557 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:11:13,557 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:13,557 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-15 00:11:13,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-15 00:11:13,574 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:11:13,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:13,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:13,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:13,611 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:11:13,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:13,634 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:11:13,634 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,655 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 280 states and 401 transitions. Complement of second has 5 states. [2024-10-15 00:11:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-15 00:11:13,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-15 00:11:13,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:13,657 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:13,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:13,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:13,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:13,697 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:11:13,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:13,721 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:11:13,721 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,738 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 280 states and 401 transitions. Complement of second has 5 states. [2024-10-15 00:11:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-15 00:11:13,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-15 00:11:13,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:13,740 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:13,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:13,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:13,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:13,779 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:11:13,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:13,798 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:11:13,798 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 334 states and 496 transitions. Complement of second has 4 states. [2024-10-15 00:11:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-10-15 00:11:13,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-15 00:11:13,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:13,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2024-10-15 00:11:13,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:13,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2024-10-15 00:11:13,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:13,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2024-10-15 00:11:13,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-10-15 00:11:13,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2024-10-15 00:11:13,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2024-10-15 00:11:13,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-10-15 00:11:13,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2024-10-15 00:11:13,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:13,827 INFO L218 hiAutomatonCegarLoop]: Abstraction has 268 states and 378 transitions. [2024-10-15 00:11:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2024-10-15 00:11:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2024-10-15 00:11:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.401197604790419) internal successors, (234), 166 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2024-10-15 00:11:13,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 234 transitions. [2024-10-15 00:11:13,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:13,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:11:13,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:11:13,835 INFO L87 Difference]: Start difference. First operand 167 states and 234 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:13,858 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2024-10-15 00:11:13,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 246 transitions. [2024-10-15 00:11:13,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2024-10-15 00:11:13,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 177 states and 243 transitions. [2024-10-15 00:11:13,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-10-15 00:11:13,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2024-10-15 00:11:13,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 243 transitions. [2024-10-15 00:11:13,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:13,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 177 states and 243 transitions. [2024-10-15 00:11:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 243 transitions. [2024-10-15 00:11:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2024-10-15 00:11:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 170 states have (on average 1.3764705882352941) internal successors, (234), 169 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2024-10-15 00:11:13,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 234 transitions. [2024-10-15 00:11:13,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:11:13,865 INFO L425 stractBuchiCegarLoop]: Abstraction has 170 states and 234 transitions. [2024-10-15 00:11:13,865 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:11:13,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 234 transitions. [2024-10-15 00:11:13,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2024-10-15 00:11:13,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:13,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:13,867 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:11:13,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2024-10-15 00:11:13,867 INFO L745 eck$LassoCheckResult]: Stem: 3427#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3428#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3432#L18-1 assume !!(main_~i~0#1 > 0); 3546#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3533#L12-2 assume !(10 == main_~i~0#1); 3435#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3436#L18-1 assume !!(main_~i~0#1 > 0); 3553#L12 assume !(1 == main_~i~0#1); 3545#L12-2 assume !(10 == main_~i~0#1); 3543#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3440#L18-1 [2024-10-15 00:11:13,867 INFO L747 eck$LassoCheckResult]: Loop: 3440#L18-1 assume !!(main_~i~0#1 > 0); 3536#L12 assume !(1 == main_~i~0#1); 3474#L12-2 assume !(10 == main_~i~0#1); 3532#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3530#L18-1 assume !!(main_~i~0#1 > 0); 3528#L12 assume !(1 == main_~i~0#1); 3525#L12-2 assume !(10 == main_~i~0#1); 3438#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3440#L18-1 [2024-10-15 00:11:13,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:13,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497813, now seen corresponding path program 1 times [2024-10-15 00:11:13,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:13,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92226966] [2024-10-15 00:11:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:11:13,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:13,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92226966] [2024-10-15 00:11:13,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92226966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:13,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:13,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:11:13,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535708330] [2024-10-15 00:11:13,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:13,889 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:11:13,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:13,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2142023595, now seen corresponding path program 1 times [2024-10-15 00:11:13,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:13,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444115119] [2024-10-15 00:11:13,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:13,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:11:13,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:13,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444115119] [2024-10-15 00:11:13,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444115119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:11:13,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:11:13,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:11:13,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838738769] [2024-10-15 00:11:13,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:11:13,913 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:11:13,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:11:13,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:11:13,914 INFO L87 Difference]: Start difference. First operand 170 states and 234 transitions. cyclomatic complexity: 73 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:13,925 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-10-15 00:11:13,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 118 transitions. [2024-10-15 00:11:13,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-15 00:11:13,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 84 states and 95 transitions. [2024-10-15 00:11:13,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-10-15 00:11:13,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-10-15 00:11:13,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 95 transitions. [2024-10-15 00:11:13,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:13,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-10-15 00:11:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 95 transitions. [2024-10-15 00:11:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-10-15 00:11:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 81 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2024-10-15 00:11:13,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-10-15 00:11:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:11:13,929 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-10-15 00:11:13,929 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:11:13,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 93 transitions. [2024-10-15 00:11:13,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-10-15 00:11:13,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:13,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:13,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 1, 1, 1, 1] [2024-10-15 00:11:13,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2024-10-15 00:11:13,931 INFO L745 eck$LassoCheckResult]: Stem: 3709#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3713#L18-1 assume !!(main_~i~0#1 > 0); 3740#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3734#L12-2 assume !(10 == main_~i~0#1); 3733#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3732#L18-1 assume !!(main_~i~0#1 > 0); 3731#L12 assume !(1 == main_~i~0#1); 3730#L12-2 assume !(10 == main_~i~0#1); 3729#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3728#L18-1 assume !!(main_~i~0#1 > 0); 3727#L12 assume !(1 == main_~i~0#1); 3726#L12-2 assume !(10 == main_~i~0#1); 3725#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3724#L18-1 assume !!(main_~i~0#1 > 0); 3721#L12 assume !(1 == main_~i~0#1); 3723#L12-2 assume !(10 == main_~i~0#1); 3722#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3720#L18-1 assume !!(main_~i~0#1 > 0); 3719#L12 assume !(1 == main_~i~0#1); 3718#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3711#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3707#L18-1 assume !!(main_~i~0#1 > 0); 3708#L12 assume !(1 == main_~i~0#1); 3702#L12-2 assume !(10 == main_~i~0#1); 3704#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3712#L18-1 assume !!(main_~i~0#1 > 0); 3714#L12 [2024-10-15 00:11:13,931 INFO L747 eck$LassoCheckResult]: Loop: 3714#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3700#L12-2 assume !(10 == main_~i~0#1); 3701#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3705#L18-1 assume !!(main_~i~0#1 > 0); 3706#L12 assume !(1 == main_~i~0#1); 3781#L12-2 assume !(10 == main_~i~0#1); 3780#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3779#L18-1 assume !!(main_~i~0#1 > 0); 3778#L12 assume !(1 == main_~i~0#1); 3777#L12-2 assume !(10 == main_~i~0#1); 3776#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3775#L18-1 assume !!(main_~i~0#1 > 0); 3774#L12 assume !(1 == main_~i~0#1); 3773#L12-2 assume !(10 == main_~i~0#1); 3748#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3744#L18-1 assume !!(main_~i~0#1 > 0); 3736#L12 assume !(1 == main_~i~0#1); 3737#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3715#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3716#L18-1 assume !!(main_~i~0#1 > 0); 3708#L12 assume !(1 == main_~i~0#1); 3702#L12-2 assume !(10 == main_~i~0#1); 3704#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3712#L18-1 assume !!(main_~i~0#1 > 0); 3714#L12 [2024-10-15 00:11:13,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash -608617554, now seen corresponding path program 2 times [2024-10-15 00:11:13,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:13,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549119147] [2024-10-15 00:11:13,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:14,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:14,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:11:14,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:14,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549119147] [2024-10-15 00:11:14,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549119147] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:11:14,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992443262] [2024-10-15 00:11:14,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:11:14,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:11:14,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:14,054 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:11:14,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-10-15 00:11:14,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:11:14,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:11:14,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:11:14,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:11:14,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:11:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:11:14,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992443262] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:11:14,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:11:14,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-15 00:11:14,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616127448] [2024-10-15 00:11:14,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:11:14,194 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:11:14,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1118663673, now seen corresponding path program 1 times [2024-10-15 00:11:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087861788] [2024-10-15 00:11:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:11:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087861788] [2024-10-15 00:11:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087861788] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:11:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32031839] [2024-10-15 00:11:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:14,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:11:14,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:14,260 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:11:14,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-10-15 00:11:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:14,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:11:14,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:11:14,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:11:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:11:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32031839] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:11:14,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:11:14,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-15 00:11:14,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664471009] [2024-10-15 00:11:14,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:11:14,382 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:11:14,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:14,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-15 00:11:14,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-15 00:11:14,383 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. cyclomatic complexity: 17 Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:14,434 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2024-10-15 00:11:14,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 180 transitions. [2024-10-15 00:11:14,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-15 00:11:14,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 160 transitions. [2024-10-15 00:11:14,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-15 00:11:14,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-15 00:11:14,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 160 transitions. [2024-10-15 00:11:14,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:14,437 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 160 transitions. [2024-10-15 00:11:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 160 transitions. [2024-10-15 00:11:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2024-10-15 00:11:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 1.0774647887323943) internal successors, (153), 141 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2024-10-15 00:11:14,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-10-15 00:11:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 00:11:14,440 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-10-15 00:11:14,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:11:14,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 153 transitions. [2024-10-15 00:11:14,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2024-10-15 00:11:14,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:14,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:14,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2024-10-15 00:11:14,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2024-10-15 00:11:14,443 INFO L745 eck$LassoCheckResult]: Stem: 4276#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4277#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4280#L18-1 assume !!(main_~i~0#1 > 0); 4382#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 4268#L12-2 assume !(10 == main_~i~0#1); 4269#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4368#L18-1 assume !!(main_~i~0#1 > 0); 4367#L12 assume !(1 == main_~i~0#1); 4366#L12-2 assume !(10 == main_~i~0#1); 4365#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4364#L18-1 assume !!(main_~i~0#1 > 0); 4363#L12 assume !(1 == main_~i~0#1); 4362#L12-2 assume !(10 == main_~i~0#1); 4361#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4360#L18-1 assume !!(main_~i~0#1 > 0); 4359#L12 assume !(1 == main_~i~0#1); 4358#L12-2 assume !(10 == main_~i~0#1); 4357#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4356#L18-1 assume !!(main_~i~0#1 > 0); 4355#L12 assume !(1 == main_~i~0#1); 4354#L12-2 assume !(10 == main_~i~0#1); 4353#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4352#L18-1 assume !!(main_~i~0#1 > 0); 4351#L12 assume !(1 == main_~i~0#1); 4350#L12-2 assume !(10 == main_~i~0#1); 4349#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4348#L18-1 assume !!(main_~i~0#1 > 0); 4347#L12 assume !(1 == main_~i~0#1); 4346#L12-2 assume !(10 == main_~i~0#1); 4345#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4344#L18-1 assume !!(main_~i~0#1 > 0); 4343#L12 assume !(1 == main_~i~0#1); 4342#L12-2 assume !(10 == main_~i~0#1); 4341#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4340#L18-1 assume !!(main_~i~0#1 > 0); 4290#L12 assume !(1 == main_~i~0#1); 4294#L12-2 assume !(10 == main_~i~0#1); 4291#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4289#L18-1 assume !!(main_~i~0#1 > 0); 4288#L12 assume !(1 == main_~i~0#1); 4287#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4278#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4279#L18-1 assume !!(main_~i~0#1 > 0); 4336#L12 assume !(1 == main_~i~0#1); 4338#L12-2 assume !(10 == main_~i~0#1); 4337#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4335#L18-1 assume !!(main_~i~0#1 > 0); 4334#L12 [2024-10-15 00:11:14,443 INFO L747 eck$LassoCheckResult]: Loop: 4334#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 4333#L12-2 assume !(10 == main_~i~0#1); 4332#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4331#L18-1 assume !!(main_~i~0#1 > 0); 4330#L12 assume !(1 == main_~i~0#1); 4329#L12-2 assume !(10 == main_~i~0#1); 4328#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4327#L18-1 assume !!(main_~i~0#1 > 0); 4326#L12 assume !(1 == main_~i~0#1); 4325#L12-2 assume !(10 == main_~i~0#1); 4324#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4323#L18-1 assume !!(main_~i~0#1 > 0); 4322#L12 assume !(1 == main_~i~0#1); 4321#L12-2 assume !(10 == main_~i~0#1); 4320#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4319#L18-1 assume !!(main_~i~0#1 > 0); 4318#L12 assume !(1 == main_~i~0#1); 4317#L12-2 assume !(10 == main_~i~0#1); 4316#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4315#L18-1 assume !!(main_~i~0#1 > 0); 4314#L12 assume !(1 == main_~i~0#1); 4313#L12-2 assume !(10 == main_~i~0#1); 4312#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4311#L18-1 assume !!(main_~i~0#1 > 0); 4310#L12 assume !(1 == main_~i~0#1); 4309#L12-2 assume !(10 == main_~i~0#1); 4308#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4307#L18-1 assume !!(main_~i~0#1 > 0); 4306#L12 assume !(1 == main_~i~0#1); 4305#L12-2 assume !(10 == main_~i~0#1); 4304#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4303#L18-1 assume !!(main_~i~0#1 > 0); 4302#L12 assume !(1 == main_~i~0#1); 4301#L12-2 assume !(10 == main_~i~0#1); 4299#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4295#L18-1 assume !!(main_~i~0#1 > 0); 4292#L12 assume !(1 == main_~i~0#1); 4293#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4284#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4285#L18-1 assume !!(main_~i~0#1 > 0); 4336#L12 assume !(1 == main_~i~0#1); 4338#L12-2 assume !(10 == main_~i~0#1); 4337#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4335#L18-1 assume !!(main_~i~0#1 > 0); 4334#L12 [2024-10-15 00:11:14,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 3 times [2024-10-15 00:11:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:14,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542140483] [2024-10-15 00:11:14,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:14,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:14,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:14,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:14,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 2 times [2024-10-15 00:11:14,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:14,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245883136] [2024-10-15 00:11:14,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:14,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:14,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:14,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:14,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 4 times [2024-10-15 00:11:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:14,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163409461] [2024-10-15 00:11:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-15 00:11:14,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163409461] [2024-10-15 00:11:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163409461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:11:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078481453] [2024-10-15 00:11:14,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:11:14,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:11:14,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:14,595 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:11:14,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-10-15 00:11:14,640 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:11:14,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:11:14,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:11:14,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-15 00:11:14,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:11:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-15 00:11:14,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078481453] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:11:14,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:11:14,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-15 00:11:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194206919] [2024-10-15 00:11:14,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:11:14,874 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:14,874 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:14,874 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:14,874 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:14,875 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:14,875 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:14,875 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:14,875 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:14,875 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-10-15 00:11:14,875 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:14,875 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:14,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:14,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:14,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:14,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:14,918 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:14,919 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:14,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:14,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:14,922 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:14,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-15 00:11:14,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:14,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:14,948 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:14,948 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_14=1} Honda state: {v_rep~unnamed0~0~true_14=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:14,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-15 00:11:14,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:14,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:14,965 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:14,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-15 00:11:14,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:14,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:14,987 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:14,987 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_14=0} Honda state: {v_rep~unnamed0~0~false_14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:15,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:15,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:15,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:15,003 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:15,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-15 00:11:15,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:15,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:15,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-15 00:11:15,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:15,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:15,033 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:15,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-15 00:11:15,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:15,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:15,048 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:15,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-15 00:11:15,063 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:15,063 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:15,063 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:15,063 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:15,063 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:15,063 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:15,063 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:15,063 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:15,063 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-10-15 00:11:15,064 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:15,064 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:15,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:15,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:15,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:15,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:15,111 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:15,111 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:15,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:15,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:15,113 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:15,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-15 00:11:15,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:15,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:15,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:15,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:15,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:15,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:15,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:15,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:15,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-15 00:11:15,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:15,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:15,148 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:15,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-15 00:11:15,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:15,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:15,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:15,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:15,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:15,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:15,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:15,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:15,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-15 00:11:15,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:15,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:15,192 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:15,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-15 00:11:15,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:15,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:15,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:15,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:15,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:15,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:15,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:11:15,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:15,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:15,217 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:11:15,217 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:11:15,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:15,220 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:15,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:15,222 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:11:15,222 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:15,222 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2024-10-15 00:11:15,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-15 00:11:15,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-15 00:11:15,238 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:11:15,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:15,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:15,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:15,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:11:15,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 00:11:15,462 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-15 00:11:15,462 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:15,504 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 228 states and 242 transitions. Complement of second has 7 states. [2024-10-15 00:11:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:11:15,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-15 00:11:15,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:15,508 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:15,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:15,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:15,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:15,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:11:15,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 00:11:15,714 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-15 00:11:15,715 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:15,784 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 238 states and 253 transitions. Complement of second has 11 states. [2024-10-15 00:11:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-15 00:11:15,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-15 00:11:15,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:15,786 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:15,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:15,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:15,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:15,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:11:15,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 00:11:15,985 INFO L141 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 [2024-10-15 00:11:15,985 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:16,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 268 states and 284 transitions. Complement of second has 9 states. [2024-10-15 00:11:16,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-10-15 00:11:16,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-15 00:11:16,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:16,018 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:16,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:16,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:16,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:16,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:11:16,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 00:11:16,220 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-15 00:11:16,220 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:16,284 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 380 states and 401 transitions. Complement of second has 19 states. [2024-10-15 00:11:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-15 00:11:16,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-15 00:11:16,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:16,288 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:16,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:16,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:16,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:16,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:11:16,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 00:11:16,515 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-15 00:11:16,517 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:16,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-15 00:11:16,717 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1899 states and 2480 transitions. Complement of second has 166 states 20 powerset states146 rank states. The highest rank that occured is 5 [2024-10-15 00:11:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2024-10-15 00:11:16,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-15 00:11:16,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:16,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2024-10-15 00:11:16,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:16,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2024-10-15 00:11:16,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:16,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1899 states and 2480 transitions. [2024-10-15 00:11:16,742 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2024-10-15 00:11:16,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1899 states to 956 states and 1245 transitions. [2024-10-15 00:11:16,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2024-10-15 00:11:16,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2024-10-15 00:11:16,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1245 transitions. [2024-10-15 00:11:16,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:16,748 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1245 transitions. [2024-10-15 00:11:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1245 transitions. [2024-10-15 00:11:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 564. [2024-10-15 00:11:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 564 states have (on average 1.3953900709219857) internal successors, (787), 563 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 787 transitions. [2024-10-15 00:11:16,756 INFO L240 hiAutomatonCegarLoop]: Abstraction has 564 states and 787 transitions. [2024-10-15 00:11:16,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:16,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 00:11:16,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-15 00:11:16,757 INFO L87 Difference]: Start difference. First operand 564 states and 787 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:16,799 INFO L93 Difference]: Finished difference Result 692 states and 978 transitions. [2024-10-15 00:11:16,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 978 transitions. [2024-10-15 00:11:16,803 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2024-10-15 00:11:16,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 675 states and 954 transitions. [2024-10-15 00:11:16,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-10-15 00:11:16,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2024-10-15 00:11:16,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 954 transitions. [2024-10-15 00:11:16,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:16,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 954 transitions. [2024-10-15 00:11:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 954 transitions. [2024-10-15 00:11:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 634. [2024-10-15 00:11:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 634 states have (on average 1.411671924290221) internal successors, (895), 633 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 895 transitions. [2024-10-15 00:11:16,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 634 states and 895 transitions. [2024-10-15 00:11:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 00:11:16,817 INFO L425 stractBuchiCegarLoop]: Abstraction has 634 states and 895 transitions. [2024-10-15 00:11:16,817 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:11:16,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 895 transitions. [2024-10-15 00:11:16,820 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2024-10-15 00:11:16,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:16,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:16,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2024-10-15 00:11:16,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2024-10-15 00:11:16,821 INFO L745 eck$LassoCheckResult]: Stem: 10858#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 10859#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 10863#L18-1 assume !!(main_~i~0#1 > 0); 11194#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 11045#L12-2 assume !(10 == main_~i~0#1); 11186#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11185#L18-1 assume !!(main_~i~0#1 > 0); 11183#L12 assume !(1 == main_~i~0#1); 11181#L12-2 assume !(10 == main_~i~0#1); 11179#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11177#L18-1 assume !!(main_~i~0#1 > 0); 11175#L12 assume !(1 == main_~i~0#1); 11173#L12-2 assume !(10 == main_~i~0#1); 11171#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11169#L18-1 assume !!(main_~i~0#1 > 0); 11167#L12 assume !(1 == main_~i~0#1); 11165#L12-2 assume !(10 == main_~i~0#1); 11163#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11161#L18-1 assume !!(main_~i~0#1 > 0); 11159#L12 assume !(1 == main_~i~0#1); 11157#L12-2 assume !(10 == main_~i~0#1); 11155#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11153#L18-1 assume !!(main_~i~0#1 > 0); 11151#L12 assume !(1 == main_~i~0#1); 11149#L12-2 assume !(10 == main_~i~0#1); 11147#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11145#L18-1 assume !!(main_~i~0#1 > 0); 11143#L12 assume !(1 == main_~i~0#1); 11141#L12-2 assume !(10 == main_~i~0#1); 11139#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11137#L18-1 assume !!(main_~i~0#1 > 0); 11135#L12 assume !(1 == main_~i~0#1); 11133#L12-2 assume !(10 == main_~i~0#1); 11131#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11127#L18-1 assume !!(main_~i~0#1 > 0); 11125#L12 assume !(1 == main_~i~0#1); 11123#L12-2 assume !(10 == main_~i~0#1); 11119#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11120#L18-1 assume !!(main_~i~0#1 > 0); 11128#L12 assume !(1 == main_~i~0#1); 11111#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11070#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11109#L18-1 assume !!(main_~i~0#1 > 0); 11108#L12 assume !(1 == main_~i~0#1); 11107#L12-2 assume !(10 == main_~i~0#1); 11105#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11104#L18-1 assume !!(main_~i~0#1 > 0); 11103#L12 assume !(1 == main_~i~0#1); 11102#L12-2 assume !(10 == main_~i~0#1); 11100#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11099#L18-1 assume !!(main_~i~0#1 > 0); 11098#L12 assume !(1 == main_~i~0#1); 11097#L12-2 assume !(10 == main_~i~0#1); 11095#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11094#L18-1 assume !!(main_~i~0#1 > 0); 11093#L12 assume !(1 == main_~i~0#1); 11092#L12-2 assume !(10 == main_~i~0#1); 11090#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11089#L18-1 assume !!(main_~i~0#1 > 0); 11042#L12 assume !(1 == main_~i~0#1); 11069#L12-2 assume !(10 == main_~i~0#1); 11046#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11047#L18-1 assume !!(main_~i~0#1 > 0); 11190#L12 [2024-10-15 00:11:16,821 INFO L747 eck$LassoCheckResult]: Loop: 11190#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 11187#L12-2 assume !(10 == main_~i~0#1); 10867#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 10868#L18-1 assume !!(main_~i~0#1 > 0); 10855#L12 assume !(1 == main_~i~0#1); 10865#L12-2 assume !(10 == main_~i~0#1); 11481#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11479#L18-1 assume !!(main_~i~0#1 > 0); 11477#L12 assume !(1 == main_~i~0#1); 11475#L12-2 assume !(10 == main_~i~0#1); 11473#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11471#L18-1 assume !!(main_~i~0#1 > 0); 11469#L12 assume !(1 == main_~i~0#1); 11467#L12-2 assume !(10 == main_~i~0#1); 11465#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11463#L18-1 assume !!(main_~i~0#1 > 0); 11461#L12 assume !(1 == main_~i~0#1); 11459#L12-2 assume !(10 == main_~i~0#1); 11457#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11455#L18-1 assume !!(main_~i~0#1 > 0); 11453#L12 assume !(1 == main_~i~0#1); 11451#L12-2 assume !(10 == main_~i~0#1); 11449#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11447#L18-1 assume !!(main_~i~0#1 > 0); 11445#L12 assume !(1 == main_~i~0#1); 11443#L12-2 assume !(10 == main_~i~0#1); 11441#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11439#L18-1 assume !!(main_~i~0#1 > 0); 11437#L12 assume !(1 == main_~i~0#1); 11435#L12-2 assume !(10 == main_~i~0#1); 11433#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11431#L18-1 assume !!(main_~i~0#1 > 0); 11430#L12 assume !(1 == main_~i~0#1); 11429#L12-2 assume !(10 == main_~i~0#1); 11425#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11426#L18-1 assume !!(main_~i~0#1 > 0); 11418#L12 assume !(1 == main_~i~0#1); 11419#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11292#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11416#L18-1 assume !!(main_~i~0#1 > 0); 11415#L12 assume !(1 == main_~i~0#1); 11414#L12-2 assume !(10 == main_~i~0#1); 11413#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11412#L18-1 assume !!(main_~i~0#1 > 0); 11411#L12 assume !(1 == main_~i~0#1); 11410#L12-2 assume !(10 == main_~i~0#1); 11409#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11408#L18-1 assume !!(main_~i~0#1 > 0); 11407#L12 assume !(1 == main_~i~0#1); 11368#L12-2 assume !(10 == main_~i~0#1); 11367#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11364#L18-1 assume !!(main_~i~0#1 > 0); 11365#L12 assume !(1 == main_~i~0#1); 11372#L12-2 assume !(10 == main_~i~0#1); 11370#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11371#L18-1 assume !!(main_~i~0#1 > 0); 11356#L12 assume !(1 == main_~i~0#1); 11352#L12-2 assume !(10 == main_~i~0#1); 11293#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11424#L18-1 assume !!(main_~i~0#1 > 0); 11190#L12 [2024-10-15 00:11:16,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 5 times [2024-10-15 00:11:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:16,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602095916] [2024-10-15 00:11:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:16,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:16,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:16,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:16,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 3 times [2024-10-15 00:11:16,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:16,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831637721] [2024-10-15 00:11:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:16,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:16,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:16,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 6 times [2024-10-15 00:11:16,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:16,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776079999] [2024-10-15 00:11:16,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:16,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-10-15 00:11:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:11:17,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776079999] [2024-10-15 00:11:17,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776079999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:11:17,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184554216] [2024-10-15 00:11:17,008 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 00:11:17,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:11:17,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:17,010 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:11:17,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2024-10-15 00:11:17,062 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2024-10-15 00:11:17,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:11:17,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:11:17,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-10-15 00:11:17,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:11:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-10-15 00:11:17,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184554216] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:11:17,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:11:17,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-10-15 00:11:17,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185379802] [2024-10-15 00:11:17,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:11:17,437 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:17,438 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:17,438 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:17,438 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:17,438 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:11:17,438 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:17,438 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:17,438 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:17,438 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-10-15 00:11:17,439 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:17,439 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:17,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:17,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:17,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:17,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:17,489 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:17,490 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:11:17,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:17,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:17,493 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:17,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-15 00:11:17,495 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:17,495 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:17,520 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:17,521 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:17,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-15 00:11:17,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:17,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:17,538 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:17,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-15 00:11:17,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:17,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:17,556 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:11:17,556 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:11:17,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-15 00:11:17,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:17,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:17,574 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:17,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-15 00:11:17,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:11:17,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:17,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-15 00:11:17,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:17,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:17,605 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:17,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-15 00:11:17,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:11:17,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:11:17,623 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:11:17,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:17,639 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:11:17,639 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:11:17,639 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:11:17,639 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:11:17,639 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:11:17,639 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:17,640 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:11:17,640 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:11:17,640 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-10-15 00:11:17,640 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:11:17,640 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:11:17,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:17,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:17,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:17,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:11:17,689 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:11:17,689 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:11:17,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:17,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:17,691 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:17,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-15 00:11:17,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:17,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:17,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:17,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:17,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:17,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:11:17,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:11:17,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:17,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:17,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:17,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:17,725 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:17,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-15 00:11:17,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:17,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:17,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:17,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:17,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:17,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:17,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:11:17,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:17,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:11:17,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-10-15 00:11:17,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:17,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:17,758 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:17,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-15 00:11:17,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:11:17,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:11:17,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:11:17,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:11:17,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:11:17,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:11:17,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:11:17,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:11:17,773 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:11:17,775 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:11:17,775 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:11:17,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:11:17,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:11:17,777 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:11:17,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-15 00:11:17,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:11:17,779 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:11:17,779 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:11:17,780 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2024-10-15 00:11:17,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-15 00:11:17,793 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:11:17,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:17,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:17,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:17,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:11:17,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 00:11:18,111 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-15 00:11:18,111 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:18,146 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1120 states and 1472 transitions. Complement of second has 7 states. [2024-10-15 00:11:18,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:11:18,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-15 00:11:18,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:18,148 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:18,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:18,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:18,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:18,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:11:18,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:18,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 00:11:18,510 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-15 00:11:18,511 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:18,581 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1179 states and 1565 transitions. Complement of second has 11 states. [2024-10-15 00:11:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-15 00:11:18,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-15 00:11:18,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:18,583 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:18,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:18,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:18,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:18,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:11:18,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 00:11:18,886 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-15 00:11:18,886 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:18,923 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1301 states and 1787 transitions. Complement of second has 9 states. [2024-10-15 00:11:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-10-15 00:11:18,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-15 00:11:18,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:18,925 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:18,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:18,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:18,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:19,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:11:19,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 00:11:19,236 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-15 00:11:19,236 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:19,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1866 states and 2535 transitions. Complement of second has 19 states. [2024-10-15 00:11:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-15 00:11:19,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-15 00:11:19,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:19,316 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:11:19,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:19,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:11:19,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:11:19,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:11:19,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:11:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 00:11:19,640 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-15 00:11:19,640 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:20,187 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11129 states and 19734 transitions. Complement of second has 282 states 36 powerset states246 rank states. The highest rank that occured is 5 [2024-10-15 00:11:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2024-10-15 00:11:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2024-10-15 00:11:20,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-15 00:11:20,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:20,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2024-10-15 00:11:20,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:20,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2024-10-15 00:11:20,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:11:20,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11129 states and 19734 transitions. [2024-10-15 00:11:20,319 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2024-10-15 00:11:20,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11129 states to 4882 states and 8741 transitions. [2024-10-15 00:11:20,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2024-10-15 00:11:20,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2024-10-15 00:11:20,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4882 states and 8741 transitions. [2024-10-15 00:11:20,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:20,356 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4882 states and 8741 transitions. [2024-10-15 00:11:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states and 8741 transitions. [2024-10-15 00:11:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3014. [2024-10-15 00:11:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 3014 states have (on average 1.813868613138686) internal successors, (5467), 3013 states have internal predecessors, (5467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 5467 transitions. [2024-10-15 00:11:20,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3014 states and 5467 transitions. [2024-10-15 00:11:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:11:20,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-15 00:11:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-15 00:11:20,437 INFO L87 Difference]: Start difference. First operand 3014 states and 5467 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:11:20,508 INFO L93 Difference]: Finished difference Result 3401 states and 6312 transitions. [2024-10-15 00:11:20,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3401 states and 6312 transitions. [2024-10-15 00:11:20,541 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2024-10-15 00:11:20,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3401 states to 3369 states and 6221 transitions. [2024-10-15 00:11:20,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2024-10-15 00:11:20,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2024-10-15 00:11:20,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3369 states and 6221 transitions. [2024-10-15 00:11:20,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:11:20,567 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3369 states and 6221 transitions. [2024-10-15 00:11:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states and 6221 transitions. [2024-10-15 00:11:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3222. [2024-10-15 00:11:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3222 states, 3222 states have (on average 1.8395406579764122) internal successors, (5927), 3221 states have internal predecessors, (5927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:11:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 5927 transitions. [2024-10-15 00:11:20,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2024-10-15 00:11:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 00:11:20,635 INFO L425 stractBuchiCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2024-10-15 00:11:20,636 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-15 00:11:20,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3222 states and 5927 transitions. [2024-10-15 00:11:20,675 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2024-10-15 00:11:20,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:11:20,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:11:20,676 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2024-10-15 00:11:20,679 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2024-10-15 00:11:20,679 INFO L745 eck$LassoCheckResult]: Stem: 37489#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 37490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 37494#L18-1 assume !!(main_~i~0#1 > 0); 37746#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 39008#L12-2 assume !(10 == main_~i~0#1); 39006#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 39004#L18-1 assume !!(main_~i~0#1 > 0); 39002#L12 assume !(1 == main_~i~0#1); 39000#L12-2 assume !(10 == main_~i~0#1); 38998#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38996#L18-1 assume !!(main_~i~0#1 > 0); 38994#L12 assume !(1 == main_~i~0#1); 38992#L12-2 assume !(10 == main_~i~0#1); 38990#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38988#L18-1 assume !!(main_~i~0#1 > 0); 38986#L12 assume !(1 == main_~i~0#1); 38984#L12-2 assume !(10 == main_~i~0#1); 38982#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38980#L18-1 assume !!(main_~i~0#1 > 0); 38978#L12 assume !(1 == main_~i~0#1); 38976#L12-2 assume !(10 == main_~i~0#1); 38974#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38972#L18-1 assume !!(main_~i~0#1 > 0); 38970#L12 assume !(1 == main_~i~0#1); 38968#L12-2 assume !(10 == main_~i~0#1); 38966#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38964#L18-1 assume !!(main_~i~0#1 > 0); 38962#L12 assume !(1 == main_~i~0#1); 38960#L12-2 assume !(10 == main_~i~0#1); 38958#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38956#L18-1 assume !!(main_~i~0#1 > 0); 38954#L12 assume !(1 == main_~i~0#1); 38952#L12-2 assume !(10 == main_~i~0#1); 38950#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38948#L18-1 assume !!(main_~i~0#1 > 0); 38941#L12 assume !(1 == main_~i~0#1); 38944#L12-2 assume !(10 == main_~i~0#1); 38945#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38939#L18-1 assume !!(main_~i~0#1 > 0); 38940#L12 assume !(1 == main_~i~0#1); 38717#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 38331#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38693#L18-1 assume !!(main_~i~0#1 > 0); 38687#L12 assume !(1 == main_~i~0#1); 38685#L12-2 assume !(10 == main_~i~0#1); 38682#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38678#L18-1 assume !!(main_~i~0#1 > 0); 38674#L12 assume !(1 == main_~i~0#1); 38670#L12-2 assume !(10 == main_~i~0#1); 38667#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38662#L18-1 assume !!(main_~i~0#1 > 0); 38663#L12 assume !(1 == main_~i~0#1); 38655#L12-2 assume !(10 == main_~i~0#1); 38650#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38645#L18-1 assume !!(main_~i~0#1 > 0); 38646#L12 assume !(1 == main_~i~0#1); 38631#L12-2 assume !(10 == main_~i~0#1); 38632#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38695#L18-1 assume !!(main_~i~0#1 > 0); 38694#L12 assume !(1 == main_~i~0#1); 38616#L12-2 assume !(10 == main_~i~0#1); 38615#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38707#L18-1 assume !!(main_~i~0#1 > 0); 38604#L12 assume !(1 == main_~i~0#1); 38599#L12-2 assume !(10 == main_~i~0#1); 38600#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38714#L18-1 assume !!(main_~i~0#1 > 0); 38709#L12 assume !(1 == main_~i~0#1); 38586#L12-2 assume !(10 == main_~i~0#1); 38587#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38901#L18-1 assume !!(main_~i~0#1 > 0); 38321#L12 assume !(1 == main_~i~0#1); 39857#L12-2 assume !(10 == main_~i~0#1); 39855#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40135#L18-1 assume !!(main_~i~0#1 > 0); 37502#L12 [2024-10-15 00:11:20,679 INFO L747 eck$LassoCheckResult]: Loop: 37502#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 37480#L12-2 assume !(10 == main_~i~0#1); 37481#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40643#L18-1 assume !!(main_~i~0#1 > 0); 37495#L12 assume !(1 == main_~i~0#1); 37496#L12-2 assume !(10 == main_~i~0#1); 40675#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40674#L18-1 assume !!(main_~i~0#1 > 0); 40673#L12 assume !(1 == main_~i~0#1); 40672#L12-2 assume !(10 == main_~i~0#1); 40671#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40670#L18-1 assume !!(main_~i~0#1 > 0); 40669#L12 assume !(1 == main_~i~0#1); 40668#L12-2 assume !(10 == main_~i~0#1); 40667#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40666#L18-1 assume !!(main_~i~0#1 > 0); 40665#L12 assume !(1 == main_~i~0#1); 40664#L12-2 assume !(10 == main_~i~0#1); 40663#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40662#L18-1 assume !!(main_~i~0#1 > 0); 40661#L12 assume !(1 == main_~i~0#1); 40660#L12-2 assume !(10 == main_~i~0#1); 40659#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40658#L18-1 assume !!(main_~i~0#1 > 0); 40657#L12 assume !(1 == main_~i~0#1); 40656#L12-2 assume !(10 == main_~i~0#1); 40655#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40654#L18-1 assume !!(main_~i~0#1 > 0); 40653#L12 assume !(1 == main_~i~0#1); 40652#L12-2 assume !(10 == main_~i~0#1); 40651#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40650#L18-1 assume !!(main_~i~0#1 > 0); 40649#L12 assume !(1 == main_~i~0#1); 40648#L12-2 assume !(10 == main_~i~0#1); 40641#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40642#L18-1 assume !!(main_~i~0#1 > 0); 40461#L12 assume !(1 == main_~i~0#1); 40462#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 39577#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40435#L18-1 assume !!(main_~i~0#1 > 0); 40432#L12 assume !(1 == main_~i~0#1); 40429#L12-2 assume !(10 == main_~i~0#1); 40426#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40425#L18-1 assume !!(main_~i~0#1 > 0); 40424#L12 assume !(1 == main_~i~0#1); 40422#L12-2 assume !(10 == main_~i~0#1); 40419#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40415#L18-1 assume !!(main_~i~0#1 > 0); 40416#L12 assume !(1 == main_~i~0#1); 40405#L12-2 assume !(10 == main_~i~0#1); 40406#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40397#L18-1 assume !!(main_~i~0#1 > 0); 40398#L12 assume !(1 == main_~i~0#1); 40384#L12-2 assume !(10 == main_~i~0#1); 40380#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40373#L18-1 assume !!(main_~i~0#1 > 0); 40374#L12 assume !(1 == main_~i~0#1); 40362#L12-2 assume !(10 == main_~i~0#1); 40358#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40359#L18-1 assume !!(main_~i~0#1 > 0); 40353#L12 assume !(1 == main_~i~0#1); 40348#L12-2 assume !(10 == main_~i~0#1); 40349#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40455#L18-1 assume !!(main_~i~0#1 > 0); 40454#L12 assume !(1 == main_~i~0#1); 40336#L12-2 assume !(10 == main_~i~0#1); 39625#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 39626#L18-1 assume !!(main_~i~0#1 > 0); 40497#L12 assume !(1 == main_~i~0#1); 39582#L12-2 assume !(10 == main_~i~0#1); 39314#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 39315#L18-1 assume !!(main_~i~0#1 > 0); 37502#L12 [2024-10-15 00:11:20,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 7 times [2024-10-15 00:11:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659903149] [2024-10-15 00:11:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:20,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:20,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:20,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 4 times [2024-10-15 00:11:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481045114] [2024-10-15 00:11:20,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:20,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:20,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:20,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:11:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 8 times [2024-10-15 00:11:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:11:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094750684] [2024-10-15 00:11:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:11:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:11:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:20,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:20,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:11:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:21,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:11:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:11:21,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:11:21 BoogieIcfgContainer [2024-10-15 00:11:21,538 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:11:21,542 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:11:21,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:11:21,543 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:11:21,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:07" (3/4) ... [2024-10-15 00:11:21,545 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-15 00:11:21,599 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-15 00:11:21,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:11:21,600 INFO L158 Benchmark]: Toolchain (without parser) took 14449.90ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 77.1MB in the beginning and 65.3MB in the end (delta: 11.8MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2024-10-15 00:11:21,600 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 151.0MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:11:21,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.88ms. Allocated memory is still 151.0MB. Free memory was 124.8MB in the beginning and 114.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:11:21,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.52ms. Allocated memory is still 151.0MB. Free memory was 114.8MB in the beginning and 113.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:11:21,602 INFO L158 Benchmark]: Boogie Preprocessor took 27.96ms. Allocated memory is still 151.0MB. Free memory was 113.4MB in the beginning and 112.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:11:21,602 INFO L158 Benchmark]: RCFGBuilder took 248.21ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 103.0MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-15 00:11:21,603 INFO L158 Benchmark]: BuchiAutomizer took 13784.64ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 102.9MB in the beginning and 70.6MB in the end (delta: 32.3MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. [2024-10-15 00:11:21,603 INFO L158 Benchmark]: Witness Printer took 57.29ms. Allocated memory is still 226.5MB. Free memory was 70.6MB in the beginning and 65.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-15 00:11:21,604 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.68ms. Allocated memory is still 151.0MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.88ms. Allocated memory is still 151.0MB. Free memory was 124.8MB in the beginning and 114.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.52ms. Allocated memory is still 151.0MB. Free memory was 114.8MB in the beginning and 113.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.96ms. Allocated memory is still 151.0MB. Free memory was 113.4MB in the beginning and 112.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 248.21ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 103.0MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 13784.64ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 102.9MB in the beginning and 70.6MB in the end (delta: 32.3MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. * Witness Printer took 57.29ms. Allocated memory is still 226.5MB. Free memory was 70.6MB in the beginning and 65.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (9 trivial, 5 deterministic, 3 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 21) and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 9) and consists of 9 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 5) and consists of 13 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 3222 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.6s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 7.7s. Construction of modules took 0.6s. Büchi inclusion checks took 4.8s. Highest rank in rank-based complementation 5. Minimization of det autom 2. Minimization of nondet autom 15. Automata minimization 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 2653 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 1, 0, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 570/640 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 742 IncrementalHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 203 mSDtfsCounter, 742 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI2 SILT3 lasso1 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax177 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf93 smp89 dnf132 smp95 tf108 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 92ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] Loop: [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) [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 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: 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 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] Loop: [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) [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 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-15 00:11:21,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2024-10-15 00:11:21,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:22,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2024-10-15 00:11:22,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2024-10-15 00:11:22,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-10-15 00:11:22,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)