./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-09 15:20:38,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:20:38,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:20:38,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:20:38,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:20:38,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:20:38,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:20:38,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:20:38,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:20:38,963 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:20:38,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:20:38,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:20:38,964 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:20:38,964 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:20:38,966 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:20:38,966 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:20:38,967 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:20:38,967 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:20:38,967 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:20:38,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:20:38,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:20:38,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:20:38,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:20:38,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:20:38,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:20:38,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:20:38,972 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:20:38,972 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:20:38,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:20:38,973 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:20:38,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:20:38,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:20:38,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:20:38,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:20:38,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:20:38,974 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:20:38,974 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-11-09 15:20:39,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:20:39,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:20:39,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:20:39,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:20:39,273 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:20:39,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-11-09 15:20:40,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:20:41,003 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:20:41,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-11-09 15:20:41,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b519d7108/11c25409d23543a293abf4292dd941ba/FLAG01342fde7 [2024-11-09 15:20:41,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b519d7108/11c25409d23543a293abf4292dd941ba [2024-11-09 15:20:41,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:20:41,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:20:41,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:20:41,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:20:41,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:20:41,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@624c13cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41, skipping insertion in model container [2024-11-09 15:20:41,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:20:41,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:20:41,275 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:20:41,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:20:41,303 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:20:41,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41 WrapperNode [2024-11-09 15:20:41,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:20:41,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:20:41,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:20:41,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:20:41,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,332 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-09 15:20:41,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:20:41,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:20:41,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:20:41,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:20:41,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,351 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 15:20:41,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:20:41,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:20:41,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:20:41,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:20:41,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (1/1) ... [2024-11-09 15:20:41,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:41,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:41,395 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-11-09 15:20:41,399 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-11-09 15:20:41,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:20:41,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:20:41,521 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:20:41,523 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:20:41,588 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-09 15:20:41,588 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:20:41,608 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:20:41,608 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:20:41,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:20:41 BoogieIcfgContainer [2024-11-09 15:20:41,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:20:41,611 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:20:41,611 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:20:41,615 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:20:41,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:20:41,616 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:20:41" (1/3) ... [2024-11-09 15:20:41,617 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54bfc2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:20:41, skipping insertion in model container [2024-11-09 15:20:41,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:20:41,617 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:41" (2/3) ... [2024-11-09 15:20:41,617 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54bfc2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:20:41, skipping insertion in model container [2024-11-09 15:20:41,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:20:41,618 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:20:41" (3/3) ... [2024-11-09 15:20:41,621 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2024-11-09 15:20:41,674 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:20:41,675 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:20:41,675 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:20:41,675 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:20:41,675 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:20:41,675 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:20:41,675 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:20:41,675 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:20:41,680 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-11-09 15:20:41,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:20:41,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:41,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:41,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:20:41,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:41,698 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:20:41,699 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-11-09 15:20:41,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:20:41,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:41,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:41,700 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:20:41,700 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:41,707 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-11-09 15:20:41,708 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-11-09 15:20:41,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:20:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279556205] [2024-11-09 15:20:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:41,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:41,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:41,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:41,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-11-09 15:20:41,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:41,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998009053] [2024-11-09 15:20:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:41,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:41,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:41,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998009053] [2024-11-09 15:20:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998009053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:41,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:20:41,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181338221] [2024-11-09 15:20:41,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:41,959 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:20:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:41,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:20:41,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:20:41,992 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-11-09 15:20:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:42,011 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2024-11-09 15:20:42,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2024-11-09 15:20:42,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:20:42,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 10 states and 15 transitions. [2024-11-09 15:20:42,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:20:42,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:20:42,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2024-11-09 15:20:42,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:20:42,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-11-09 15:20:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2024-11-09 15:20:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-09 15:20:42,043 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-11-09 15:20:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2024-11-09 15:20:42,046 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-11-09 15:20:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:20:42,055 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-11-09 15:20:42,056 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:20:42,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2024-11-09 15:20:42,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:20:42,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:42,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:42,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:20:42,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:42,059 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-11-09 15:20:42,059 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-11-09 15:20:42,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-09 15:20:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:42,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248947724] [2024-11-09 15:20:42,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:42,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:42,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:42,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:42,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2024-11-09 15:20:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308846233] [2024-11-09 15:20:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:42,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308846233] [2024-11-09 15:20:42,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308846233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:42,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:42,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:20:42,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164044865] [2024-11-09 15:20:42,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:42,125 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:20:42,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:42,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:20:42,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:20:42,127 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-11-09 15:20:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:42,154 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2024-11-09 15:20:42,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2024-11-09 15:20:42,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-09 15:20:42,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2024-11-09 15:20:42,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:20:42,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:20:42,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2024-11-09 15:20:42,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:20:42,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-11-09 15:20:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2024-11-09 15:20:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-09 15:20:42,163 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-11-09 15:20:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2024-11-09 15:20:42,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-11-09 15:20:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:20:42,166 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-11-09 15:20:42,168 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:20:42,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2024-11-09 15:20:42,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-09 15:20:42,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:42,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:42,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:20:42,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:42,170 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-11-09 15:20:42,170 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-11-09 15:20:42,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-09 15:20:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:42,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794082776] [2024-11-09 15:20:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:42,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:42,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:42,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:42,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2024-11-09 15:20:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:42,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087100897] [2024-11-09 15:20:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:42,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:42,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:42,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:42,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2024-11-09 15:20:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:42,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748023830] [2024-11-09 15:20:42,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:42,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:42,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:42,306 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:42,306 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:42,307 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:42,307 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:42,307 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:42,307 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,307 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:42,307 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:42,308 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2024-11-09 15:20:42,308 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:42,308 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:42,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:42,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:42,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:42,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:42,443 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:42,444 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:42,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:42,449 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-11-09 15:20:42,451 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-11-09 15:20:42,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:42,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:42,468 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:42,469 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-11-09 15:20:42,482 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-11-09 15:20:42,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:42,485 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-11-09 15:20:42,487 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-11-09 15:20:42,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:42,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:42,508 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:42,509 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-11-09 15:20:42,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:20:42,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:42,528 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-11-09 15:20:42,529 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-11-09 15:20:42,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:42,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:42,553 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:42,555 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-11-09 15:20:42,570 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-11-09 15:20:42,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:42,575 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-11-09 15:20:42,576 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-11-09 15:20:42,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:42,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:42,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:20:42,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:42,606 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-11-09 15:20:42,607 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-11-09 15:20:42,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:42,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:42,622 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:42,637 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-11-09 15:20:42,638 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:42,638 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:42,638 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:42,638 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:42,638 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:42,638 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,639 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:42,639 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:42,639 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2024-11-09 15:20:42,639 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:42,639 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:42,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:42,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:42,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:42,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:42,722 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:42,725 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:42,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:42,728 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-11-09 15:20:42,729 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-11-09 15:20:42,730 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-11-09 15:20:42,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:42,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:42,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:42,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:42,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:42,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:42,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:42,770 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-11-09 15:20:42,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:42,772 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-11-09 15:20:42,787 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-11-09 15:20:42,788 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-11-09 15:20:42,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:42,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:42,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:42,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:42,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:42,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:42,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:42,832 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-11-09 15:20:42,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:42,834 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-11-09 15:20:42,836 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-11-09 15:20:42,841 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-11-09 15:20:42,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:42,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:42,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:42,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:42,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:42,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:42,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:42,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:42,885 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:42,886 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:20:42,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:42,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:43,016 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-11-09 15:20:43,017 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-11-09 15:20:43,019 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:43,019 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:43,019 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:43,020 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-11-09 15:20:43,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:43,034 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:43,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:43,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:20:43,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:43,107 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-11-09 15:20:43,108 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-11-09 15:20:43,158 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-11-09 15:20:43,159 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-11-09 15:20:43,160 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-11-09 15:20:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-09 15:20:43,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-09 15:20:43,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:43,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-09 15:20:43,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:43,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-09 15:20:43,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:43,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2024-11-09 15:20:43,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2024-11-09 15:20:43,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2024-11-09 15:20:43,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-09 15:20:43,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 15:20:43,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2024-11-09 15:20:43,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:43,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2024-11-09 15:20:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2024-11-09 15:20:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-09 15:20:43,169 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-11-09 15:20:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-11-09 15:20:43,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-09 15:20:43,170 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-09 15:20:43,170 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:20:43,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2024-11-09 15:20:43,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-11-09 15:20:43,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:43,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:43,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:20:43,172 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:43,172 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-11-09 15:20:43,173 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-11-09 15:20:43,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-11-09 15:20:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:43,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087328559] [2024-11-09 15:20:43,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:43,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:43,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2024-11-09 15:20:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:43,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683054617] [2024-11-09 15:20:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:43,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:43,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2024-11-09 15:20:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141468499] [2024-11-09 15:20:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:43,271 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:43,272 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:43,272 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:43,272 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:43,272 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:43,272 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:43,272 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:43,272 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:43,272 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-11-09 15:20:43,272 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:43,272 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:43,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:43,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:43,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:43,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:43,375 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:43,375 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:43,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:43,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:43,377 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-11-09 15:20:43,379 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-11-09 15:20:43,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:43,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:43,405 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:43,405 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-11-09 15:20:43,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:20:43,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:43,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:43,427 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-11-09 15:20:43,429 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-11-09 15:20:43,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:43,430 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:43,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:20:43,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:43,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:43,464 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-11-09 15:20:43,466 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-11-09 15:20:43,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:43,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:43,542 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:43,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-09 15:20:43,551 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:43,551 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:43,551 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:43,552 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:43,552 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:43,552 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:43,552 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:43,552 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:43,552 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-11-09 15:20:43,552 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:43,552 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:43,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:43,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:43,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:43,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:43,670 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:43,670 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:43,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:43,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:43,688 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-11-09 15:20:43,701 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-11-09 15:20:43,702 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-11-09 15:20:43,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:43,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:43,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:43,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:43,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:43,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:43,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:43,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:20:43,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:43,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:43,751 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-11-09 15:20:43,753 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-11-09 15:20:43,754 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-11-09 15:20:43,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:43,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:43,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:43,766 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:20:43,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:43,771 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:20:43,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:43,778 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:43,782 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-09 15:20:43,782 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:20:43,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:43,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:43,785 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-11-09 15:20:43,786 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-11-09 15:20:43,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:43,787 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:43,788 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:43,788 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-11-09 15:20:43,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:43,803 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:43,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:43,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:43,838 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:20:43,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:43,883 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-11-09 15:20:43,883 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-11-09 15:20:43,919 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-11-09 15:20:43,921 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-11-09 15:20:43,922 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-11-09 15:20:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:20:43,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-09 15:20:43,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:43,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2024-11-09 15:20:43,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:43,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2024-11-09 15:20:43,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:43,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2024-11-09 15:20:43,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-09 15:20:43,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2024-11-09 15:20:43,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-09 15:20:43,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-09 15:20:43,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2024-11-09 15:20:43,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:43,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-11-09 15:20:43,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2024-11-09 15:20:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 15:20:43,937 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-11-09 15:20:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2024-11-09 15:20:43,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-11-09 15:20:43,940 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-11-09 15:20:43,940 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:20:43,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2024-11-09 15:20:43,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-09 15:20:43,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:43,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:43,944 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:20:43,944 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:43,944 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-11-09 15:20:43,944 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-11-09 15:20:43,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2024-11-09 15:20:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742968478] [2024-11-09 15:20:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:43,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2024-11-09 15:20:43,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:43,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371056092] [2024-11-09 15:20:43,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:43,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2024-11-09 15:20:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:43,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107344275] [2024-11-09 15:20:43,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:43,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:43,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:44,035 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:44,035 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:44,035 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:44,035 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:44,036 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:44,036 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,036 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:44,036 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:44,036 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2024-11-09 15:20:44,036 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:44,036 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:44,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,139 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:44,140 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:44,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,142 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-11-09 15:20:44,143 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-11-09 15:20:44,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:20:44,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,181 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-11-09 15:20:44,182 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-11-09 15:20:44,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:44,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,222 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,223 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-11-09 15:20:44,236 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-11-09 15:20:44,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,238 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-11-09 15:20:44,239 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-11-09 15:20:44,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,259 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,259 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-11-09 15:20:44,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:44,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,271 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-11-09 15:20:44,272 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-11-09 15:20:44,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,284 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,284 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-11-09 15:20:44,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:44,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,296 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-11-09 15:20:44,296 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-11-09 15:20:44,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,315 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,315 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-11-09 15:20:44,325 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-11-09 15:20:44,355 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:44,355 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:44,355 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:44,355 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:44,355 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:44,355 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,355 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:44,355 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:44,356 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2024-11-09 15:20:44,356 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:44,356 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:44,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,486 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:44,486 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:44,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,489 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-11-09 15:20:44,490 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-11-09 15:20:44,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,511 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,511 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-11-09 15:20:44,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:20:44,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,528 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-11-09 15:20:44,530 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-11-09 15:20:44,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,547 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,548 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-11-09 15:20:44,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:20:44,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,563 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-11-09 15:20:44,564 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-11-09 15:20:44,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,585 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,585 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-11-09 15:20:44,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-09 15:20:44,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,602 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-11-09 15:20:44,603 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-11-09 15:20:44,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,622 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:44,622 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-11-09 15:20:44,635 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-11-09 15:20:44,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,637 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-11-09 15:20:44,637 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-11-09 15:20:44,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:44,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,659 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-11-09 15:20:44,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,661 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-11-09 15:20:44,662 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-11-09 15:20:44,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:44,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:44,695 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:44,700 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-11-09 15:20:44,700 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:44,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:44,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:44,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:44,701 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:44,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:44,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:44,701 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2024-11-09 15:20:44,701 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:44,701 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:44,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:44,835 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:44,835 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:44,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,837 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-11-09 15:20:44,838 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-11-09 15:20:44,839 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-11-09 15:20:44,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:44,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:44,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:44,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:44,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:44,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:44,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:44,869 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-11-09 15:20:44,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,870 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-11-09 15:20:44,872 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-11-09 15:20:44,872 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-11-09 15:20:44,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:44,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:44,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:44,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:44,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:44,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:44,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:44,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:44,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:44,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,899 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-11-09 15:20:44,900 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-11-09 15:20:44,901 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-11-09 15:20:44,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:44,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:44,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:44,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:44,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:44,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:44,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:44,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-09 15:20:44,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,935 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-11-09 15:20:44,935 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-11-09 15:20:44,938 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-11-09 15:20:44,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:44,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:44,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:44,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:44,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:44,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:44,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:44,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:44,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-09 15:20:44,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,963 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-11-09 15:20:44,964 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-11-09 15:20:44,964 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-11-09 15:20:44,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:44,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:44,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:44,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:44,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:44,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:44,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:44,990 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-11-09 15:20:44,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:44,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:44,992 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-11-09 15:20:44,993 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-11-09 15:20:44,993 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-11-09 15:20:45,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:45,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:45,004 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:20:45,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:45,015 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-09 15:20:45,015 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-09 15:20:45,028 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:45,058 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-09 15:20:45,058 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-09 15:20:45,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:45,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:45,061 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-11-09 15:20:45,062 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-11-09 15:20:45,063 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:45,077 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-11-09 15:20:45,077 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:45,077 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-11-09 15:20:45,088 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-11-09 15:20:45,091 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-11-09 15:20:45,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:45,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:20:45,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:45,154 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:45,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:45,199 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-11-09 15:20:45,200 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-11-09 15:20:45,272 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-11-09 15:20:45,273 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-11-09 15:20:45,274 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-11-09 15:20:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-11-09 15:20:45,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-09 15:20:45,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:45,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-09 15:20:45,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:45,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2024-11-09 15:20:45,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:45,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2024-11-09 15:20:45,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-09 15:20:45,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2024-11-09 15:20:45,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-09 15:20:45,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-09 15:20:45,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2024-11-09 15:20:45,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:45,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-11-09 15:20:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2024-11-09 15:20:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-09 15:20:45,280 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-11-09 15:20:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2024-11-09 15:20:45,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 64 transitions. [2024-11-09 15:20:45,281 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2024-11-09 15:20:45,281 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:20:45,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2024-11-09 15:20:45,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-09 15:20:45,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:45,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:45,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:45,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:45,284 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-11-09 15:20:45,284 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-11-09 15:20:45,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2024-11-09 15:20:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:45,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898778462] [2024-11-09 15:20:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:45,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:45,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898778462] [2024-11-09 15:20:45,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898778462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:45,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079512903] [2024-11-09 15:20:45,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:45,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:45,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:45,321 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-11-09 15:20:45,322 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-11-09 15:20:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:45,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:20:45,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:45,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:45,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079512903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:45,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:45,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-09 15:20:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547682026] [2024-11-09 15:20:45,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:45,381 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:45,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:45,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2024-11-09 15:20:45,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:45,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925894260] [2024-11-09 15:20:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:45,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:45,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:45,421 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:45,421 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:45,421 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:45,421 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:45,421 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:45,421 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:45,421 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:45,421 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:45,421 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2024-11-09 15:20:45,421 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:45,421 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:45,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,484 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:45,484 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:45,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:45,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:45,486 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-11-09 15:20:45,498 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-11-09 15:20:45,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:45,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:45,527 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-11-09 15:20:45,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-09 15:20:45,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:45,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:45,539 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-11-09 15:20:45,542 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-11-09 15:20:45,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:45,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:45,546 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-11-09 15:20:45,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:45,580 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:45,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:45,613 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:45,613 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:45,613 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:45,613 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:45,613 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:45,614 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:45,614 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:45,614 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:45,614 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2024-11-09 15:20:45,614 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:45,614 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:45,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,675 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:45,675 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:45,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:45,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:45,678 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-11-09 15:20:45,679 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-11-09 15:20:45,679 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-11-09 15:20:45,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:45,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:45,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:45,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:45,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:45,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:45,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:45,692 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:45,693 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-09 15:20:45,693 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:20:45,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:45,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:45,695 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-11-09 15:20:45,696 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-11-09 15:20:45,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:45,697 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:45,697 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:45,697 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-11-09 15:20:45,709 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-11-09 15:20:45,710 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:45,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:45,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:45,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:45,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:20:45,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:45,752 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-11-09 15:20:45,752 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-11-09 15:20:45,776 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-11-09 15:20:45,777 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-11-09 15:20:45,778 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-11-09 15:20:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-09 15:20:45,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-09 15:20:45,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:45,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2024-11-09 15:20:45,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:45,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2024-11-09 15:20:45,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:45,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2024-11-09 15:20:45,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-09 15:20:45,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2024-11-09 15:20:45,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 15:20:45,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-11-09 15:20:45,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2024-11-09 15:20:45,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:45,783 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-11-09 15:20:45,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2024-11-09 15:20:45,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-11-09 15:20:45,788 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-11-09 15:20:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-11-09 15:20:45,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-11-09 15:20:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:45,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:20:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:20:45,790 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-11-09 15:20:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:45,832 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2024-11-09 15:20:45,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2024-11-09 15:20:45,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-11-09 15:20:45,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2024-11-09 15:20:45,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2024-11-09 15:20:45,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-09 15:20:45,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2024-11-09 15:20:45,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:45,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 239 transitions. [2024-11-09 15:20:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2024-11-09 15:20:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2024-11-09 15:20:45,844 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-11-09 15:20:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2024-11-09 15:20:45,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-11-09 15:20:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:20:45,846 INFO L425 stractBuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-11-09 15:20:45,846 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:20:45,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2024-11-09 15:20:45,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-11-09 15:20:45,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:45,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:45,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-09 15:20:45,849 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:45,849 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-11-09 15:20:45,849 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-11-09 15:20:45,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2024-11-09 15:20:45,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:45,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338979272] [2024-11-09 15:20:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:45,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:45,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338979272] [2024-11-09 15:20:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338979272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:45,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:45,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:20:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940395819] [2024-11-09 15:20:45,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:45,901 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:45,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2024-11-09 15:20:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:45,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539798875] [2024-11-09 15:20:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:45,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:45,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:45,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:45,936 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:45,936 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:45,936 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:45,936 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:45,936 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:45,936 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:45,936 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:45,937 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:45,937 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-11-09 15:20:45,937 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:45,937 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:45,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:45,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,022 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:46,022 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:46,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,024 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-11-09 15:20:46,025 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-11-09 15:20:46,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:46,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:46,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-09 15:20:46,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,048 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-11-09 15:20:46,049 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-11-09 15:20:46,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:46,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:46,081 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:46,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:46,086 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:46,086 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:46,086 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:46,086 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:46,086 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:46,086 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,086 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:46,086 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:46,086 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-11-09 15:20:46,086 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:46,086 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:46,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,167 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:46,168 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:46,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,169 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-11-09 15:20:46,170 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-11-09 15:20:46,170 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-11-09 15:20:46,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:46,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:46,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:46,180 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:20:46,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:46,182 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:20:46,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:46,185 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:46,186 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-09 15:20:46,186 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:20:46,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,188 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-11-09 15:20:46,189 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-11-09 15:20:46,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:46,189 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:46,189 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:46,189 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-11-09 15:20:46,200 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-11-09 15:20:46,201 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:46,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:46,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:46,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:46,234 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:20:46,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:46,262 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-11-09 15:20:46,262 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-11-09 15:20:46,290 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-11-09 15:20:46,290 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-11-09 15:20:46,291 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-11-09 15:20:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-09 15:20:46,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-09 15:20:46,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:46,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-09 15:20:46,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:46,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2024-11-09 15:20:46,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:46,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2024-11-09 15:20:46,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-11-09 15:20:46,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2024-11-09 15:20:46,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2024-11-09 15:20:46,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2024-11-09 15:20:46,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2024-11-09 15:20:46,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:46,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224 states and 333 transitions. [2024-11-09 15:20:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2024-11-09 15:20:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2024-11-09 15:20:46,310 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-11-09 15:20:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2024-11-09 15:20:46,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 304 transitions. [2024-11-09 15:20:46,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:46,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:20:46,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:20:46,312 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-11-09 15:20:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:46,329 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2024-11-09 15:20:46,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2024-11-09 15:20:46,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2024-11-09 15:20:46,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2024-11-09 15:20:46,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2024-11-09 15:20:46,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-11-09 15:20:46,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2024-11-09 15:20:46,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:46,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 313 transitions. [2024-11-09 15:20:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2024-11-09 15:20:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2024-11-09 15:20:46,341 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-11-09 15:20:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2024-11-09 15:20:46,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-11-09 15:20:46,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:20:46,346 INFO L425 stractBuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-11-09 15:20:46,346 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:20:46,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2024-11-09 15:20:46,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-11-09 15:20:46,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:46,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:46,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:20:46,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:20:46,349 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-11-09 15:20:46,349 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-11-09 15:20:46,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1454758974, now seen corresponding path program 1 times [2024-11-09 15:20:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:46,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818958518] [2024-11-09 15:20:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:20:46,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:46,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818958518] [2024-11-09 15:20:46,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818958518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:46,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:46,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:20:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585689890] [2024-11-09 15:20:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:46,393 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:46,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2024-11-09 15:20:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:46,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117018089] [2024-11-09 15:20:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:46,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:46,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:46,426 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:46,427 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:46,427 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:46,427 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:46,427 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:46,427 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,427 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:46,427 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:46,427 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-11-09 15:20:46,427 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:46,427 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:46,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,518 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:46,518 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:46,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,520 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-11-09 15:20:46,521 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-11-09 15:20:46,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:46,523 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:46,540 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:46,540 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-11-09 15:20:46,551 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-11-09 15:20:46,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,553 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-11-09 15:20:46,554 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-11-09 15:20:46,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:46,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:46,573 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:46,573 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-11-09 15:20:46,583 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-11-09 15:20:46,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,585 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-11-09 15:20:46,586 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-11-09 15:20:46,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:46,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:46,604 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:46,605 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-11-09 15:20:46,614 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-11-09 15:20:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,616 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-11-09 15:20:46,617 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-11-09 15:20:46,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:46,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:46,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-09 15:20:46,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,640 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-11-09 15:20:46,641 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-11-09 15:20:46,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:46,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:46,673 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:46,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-09 15:20:46,677 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:46,677 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:46,677 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:46,677 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:46,677 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:46,678 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,678 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:46,678 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:46,678 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-11-09 15:20:46,678 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:46,678 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:46,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:46,760 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:46,760 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:46,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,762 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-11-09 15:20:46,763 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-11-09 15:20:46,764 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-11-09 15:20:46,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:46,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:46,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:46,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:46,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:46,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:46,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:46,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-09 15:20:46,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,795 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-11-09 15:20:46,796 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-11-09 15:20:46,797 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-11-09 15:20:46,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:46,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:46,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:46,810 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:20:46,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:46,811 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:20:46,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:46,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:46,827 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-11-09 15:20:46,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,828 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-11-09 15:20:46,829 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-11-09 15:20:46,829 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-11-09 15:20:46,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:46,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:46,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:46,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:46,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:46,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:46,844 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:46,858 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-11-09 15:20:46,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,860 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-11-09 15:20:46,861 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-11-09 15:20:46,862 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-11-09 15:20:46,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:46,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:46,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:46,875 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:20:46,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:46,876 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:20:46,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:46,879 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:46,881 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-09 15:20:46,881 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:20:46,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:46,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:46,883 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-11-09 15:20:46,885 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-11-09 15:20:46,885 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:46,886 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:46,886 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:46,886 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-11-09 15:20:46,900 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-11-09 15:20:46,901 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:46,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:46,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:46,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:46,959 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:20:46,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:46,981 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-11-09 15:20:46,982 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-11-09 15:20:47,011 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-11-09 15:20:47,012 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-11-09 15:20:47,013 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-11-09 15:20:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-09 15:20:47,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-09 15:20:47,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:47,013 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:47,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:47,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:47,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:47,062 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:20:47,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:47,082 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-11-09 15:20:47,082 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-11-09 15:20:47,104 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-11-09 15:20:47,105 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-11-09 15:20:47,106 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-11-09 15:20:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-09 15:20:47,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-09 15:20:47,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:47,106 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:47,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:47,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:47,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:47,143 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:20:47,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:47,167 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-11-09 15:20:47,167 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-11-09 15:20:47,187 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-11-09 15:20:47,188 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-11-09 15:20:47,189 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-11-09 15:20:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-11-09 15:20:47,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-09 15:20:47,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:47,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2024-11-09 15:20:47,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:47,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2024-11-09 15:20:47,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:47,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2024-11-09 15:20:47,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-11-09 15:20:47,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2024-11-09 15:20:47,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2024-11-09 15:20:47,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-11-09 15:20:47,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2024-11-09 15:20:47,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:47,196 INFO L218 hiAutomatonCegarLoop]: Abstraction has 268 states and 378 transitions. [2024-11-09 15:20:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2024-11-09 15:20:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2024-11-09 15:20:47,203 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-11-09 15:20:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2024-11-09 15:20:47,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 234 transitions. [2024-11-09 15:20:47,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:47,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:20:47,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:20:47,204 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-11-09 15:20:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:47,229 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2024-11-09 15:20:47,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 246 transitions. [2024-11-09 15:20:47,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2024-11-09 15:20:47,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 177 states and 243 transitions. [2024-11-09 15:20:47,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-11-09 15:20:47,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2024-11-09 15:20:47,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 243 transitions. [2024-11-09 15:20:47,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:47,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 177 states and 243 transitions. [2024-11-09 15:20:47,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 243 transitions. [2024-11-09 15:20:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2024-11-09 15:20:47,239 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-11-09 15:20:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2024-11-09 15:20:47,240 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 234 transitions. [2024-11-09 15:20:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:20:47,245 INFO L425 stractBuchiCegarLoop]: Abstraction has 170 states and 234 transitions. [2024-11-09 15:20:47,245 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:20:47,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 234 transitions. [2024-11-09 15:20:47,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2024-11-09 15:20:47,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:47,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:47,250 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:20:47,250 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2024-11-09 15:20:47,250 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-11-09 15:20:47,250 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-11-09 15:20:47,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497813, now seen corresponding path program 1 times [2024-11-09 15:20:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017288756] [2024-11-09 15:20:47,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:47,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:20:47,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:47,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017288756] [2024-11-09 15:20:47,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017288756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:47,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:47,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:20:47,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463490215] [2024-11-09 15:20:47,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:47,271 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:47,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2142023595, now seen corresponding path program 1 times [2024-11-09 15:20:47,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:47,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278705920] [2024-11-09 15:20:47,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:20:47,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278705920] [2024-11-09 15:20:47,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278705920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:20:47,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:20:47,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:20:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467478046] [2024-11-09 15:20:47,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:20:47,287 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:20:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:47,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:20:47,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:20:47,288 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-11-09 15:20:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:47,298 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-11-09 15:20:47,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 118 transitions. [2024-11-09 15:20:47,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-09 15:20:47,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 84 states and 95 transitions. [2024-11-09 15:20:47,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-09 15:20:47,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-09 15:20:47,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 95 transitions. [2024-11-09 15:20:47,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:47,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-11-09 15:20:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 95 transitions. [2024-11-09 15:20:47,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-09 15:20:47,301 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-11-09 15:20:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2024-11-09 15:20:47,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-11-09 15:20:47,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:20:47,305 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-11-09 15:20:47,305 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:20:47,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 93 transitions. [2024-11-09 15:20:47,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-11-09 15:20:47,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:47,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:47,306 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 1, 1, 1, 1] [2024-11-09 15:20:47,306 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2024-11-09 15:20:47,306 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-11-09 15:20:47,306 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-11-09 15:20:47,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:47,307 INFO L85 PathProgramCache]: Analyzing trace with hash -608617554, now seen corresponding path program 2 times [2024-11-09 15:20:47,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:47,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102657416] [2024-11-09 15:20:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:47,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:20:47,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:47,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102657416] [2024-11-09 15:20:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102657416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:47,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341961708] [2024-11-09 15:20:47,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:20:47,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:47,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:47,403 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-11-09 15:20:47,405 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-11-09 15:20:47,433 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:20:47,433 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:20:47,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:47,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:20:47,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:20:47,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341961708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:47,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:47,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-09 15:20:47,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842470122] [2024-11-09 15:20:47,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:47,530 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:20:47,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1118663673, now seen corresponding path program 1 times [2024-11-09 15:20:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:47,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163779544] [2024-11-09 15:20:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:20:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163779544] [2024-11-09 15:20:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163779544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639053385] [2024-11-09 15:20:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:47,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:47,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:47,590 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-11-09 15:20:47,591 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-11-09 15:20:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:47,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:47,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:47,651 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-11-09 15:20:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:20:47,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:47,676 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-11-09 15:20:47,707 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-11-09 15:20:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 15:20:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639053385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:47,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:47,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-09 15:20:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848550383] [2024-11-09 15:20:47,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:47,740 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:20:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:47,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 15:20:47,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 15:20:47,741 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-11-09 15:20:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:47,782 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2024-11-09 15:20:47,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 180 transitions. [2024-11-09 15:20:47,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-09 15:20:47,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 160 transitions. [2024-11-09 15:20:47,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-09 15:20:47,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-09 15:20:47,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 160 transitions. [2024-11-09 15:20:47,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:47,784 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 160 transitions. [2024-11-09 15:20:47,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 160 transitions. [2024-11-09 15:20:47,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2024-11-09 15:20:47,786 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-11-09 15:20:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2024-11-09 15:20:47,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-11-09 15:20:47,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 15:20:47,787 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-11-09 15:20:47,787 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:20:47,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 153 transitions. [2024-11-09 15:20:47,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2024-11-09 15:20:47,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:47,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:47,789 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2024-11-09 15:20:47,789 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2024-11-09 15:20:47,790 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-11-09 15:20:47,790 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-11-09 15:20:47,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 3 times [2024-11-09 15:20:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:47,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285232760] [2024-11-09 15:20:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:47,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:47,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:47,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:47,818 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 2 times [2024-11-09 15:20:47,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:47,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416728317] [2024-11-09 15:20:47,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:47,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:47,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:47,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:47,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 4 times [2024-11-09 15:20:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:47,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046233346] [2024-11-09 15:20:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 15:20:47,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046233346] [2024-11-09 15:20:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046233346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488303858] [2024-11-09 15:20:47,938 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:20:47,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:47,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:47,940 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-11-09 15:20:47,941 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-11-09 15:20:47,988 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:20:47,988 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:20:47,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:20:47,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 15:20:48,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 15:20:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488303858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:48,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-09 15:20:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034500645] [2024-11-09 15:20:48,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:48,162 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:48,162 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:48,162 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:48,162 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:48,162 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:48,162 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,162 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:48,163 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:48,163 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-11-09 15:20:48,163 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:48,163 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:48,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,208 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:48,208 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:48,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,210 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-11-09 15:20:48,211 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-11-09 15:20:48,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:48,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:48,236 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:48,237 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-11-09 15:20:48,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:48,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,253 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-11-09 15:20:48,255 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-11-09 15:20:48,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:48,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:48,279 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:48,279 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-11-09 15:20:48,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-09 15:20:48,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,296 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-11-09 15:20:48,298 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:48,298 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:48,300 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-11-09 15:20:48,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:48,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,331 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-11-09 15:20:48,332 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-11-09 15:20:48,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:48,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:48,349 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:48,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:48,364 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:48,364 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:48,364 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:48,364 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:48,364 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:48,364 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,365 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:48,365 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:48,365 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-11-09 15:20:48,365 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:48,365 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:48,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:48,411 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:48,411 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:48,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,427 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-11-09 15:20:48,427 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-11-09 15:20:48,428 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-11-09 15:20:48,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:48,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:48,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:48,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:48,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:48,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:48,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:48,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:48,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,463 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-11-09 15:20:48,464 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-11-09 15:20:48,465 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-11-09 15:20:48,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:48,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:48,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:48,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:48,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:48,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:48,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:48,498 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-11-09 15:20:48,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,501 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-11-09 15:20:48,502 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-11-09 15:20:48,503 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-11-09 15:20:48,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:48,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:48,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:48,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:48,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:48,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:48,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:48,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:48,523 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:48,523 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:20:48,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:48,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:48,525 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-11-09 15:20:48,527 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-11-09 15:20:48,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:48,527 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:48,527 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:48,527 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-11-09 15:20:48,541 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-11-09 15:20:48,542 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:48,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:48,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:48,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:48,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:48,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 15:20:48,733 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-11-09 15:20:48,733 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-11-09 15:20:48,774 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-11-09 15:20:48,775 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-11-09 15:20:48,776 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-11-09 15:20:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:20:48,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2024-11-09 15:20:48,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:48,776 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:48,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:48,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:48,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:48,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:48,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 15:20:48,972 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-11-09 15:20:48,972 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-11-09 15:20:49,025 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-11-09 15:20:49,026 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-11-09 15:20:49,026 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-11-09 15:20:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-09 15:20:49,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2024-11-09 15:20:49,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:49,027 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:49,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:49,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:49,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:49,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:49,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 15:20:49,213 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-11-09 15:20:49,214 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-11-09 15:20:49,243 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-11-09 15:20:49,244 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-11-09 15:20:49,244 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-11-09 15:20:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-09 15:20:49,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2024-11-09 15:20:49,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:49,250 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:49,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:49,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:49,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:49,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:49,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:49,370 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-11-09 15:20:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 15:20:49,448 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-11-09 15:20:49,449 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-11-09 15:20:49,514 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-11-09 15:20:49,515 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-11-09 15:20:49,515 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-11-09 15:20:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-11-09 15:20:49,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2024-11-09 15:20:49,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:49,517 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:49,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:49,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:49,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:49,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:20:49,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 15:20:49,704 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-11-09 15:20:49,705 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-11-09 15:20:49,910 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-11-09 15:20:49,910 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-11-09 15:20:49,911 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-11-09 15:20:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2024-11-09 15:20:49,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2024-11-09 15:20:49,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:49,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2024-11-09 15:20:49,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:49,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2024-11-09 15:20:49,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:49,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1899 states and 2480 transitions. [2024-11-09 15:20:49,940 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2024-11-09 15:20:49,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1899 states to 956 states and 1245 transitions. [2024-11-09 15:20:49,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2024-11-09 15:20:49,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2024-11-09 15:20:49,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1245 transitions. [2024-11-09 15:20:49,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:49,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1245 transitions. [2024-11-09 15:20:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1245 transitions. [2024-11-09 15:20:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 564. [2024-11-09 15:20:49,954 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-11-09 15:20:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 787 transitions. [2024-11-09 15:20:49,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 564 states and 787 transitions. [2024-11-09 15:20:49,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:49,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 15:20:49,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:20:49,957 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-11-09 15:20:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:50,000 INFO L93 Difference]: Finished difference Result 692 states and 978 transitions. [2024-11-09 15:20:50,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 978 transitions. [2024-11-09 15:20:50,004 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2024-11-09 15:20:50,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 675 states and 954 transitions. [2024-11-09 15:20:50,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-11-09 15:20:50,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2024-11-09 15:20:50,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 954 transitions. [2024-11-09 15:20:50,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:50,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 954 transitions. [2024-11-09 15:20:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 954 transitions. [2024-11-09 15:20:50,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 634. [2024-11-09 15:20:50,017 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-11-09 15:20:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 895 transitions. [2024-11-09 15:20:50,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 634 states and 895 transitions. [2024-11-09 15:20:50,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:20:50,019 INFO L425 stractBuchiCegarLoop]: Abstraction has 634 states and 895 transitions. [2024-11-09 15:20:50,019 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:20:50,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 895 transitions. [2024-11-09 15:20:50,023 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2024-11-09 15:20:50,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:50,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:50,024 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2024-11-09 15:20:50,024 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2024-11-09 15:20:50,025 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-11-09 15:20:50,025 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-11-09 15:20:50,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 5 times [2024-11-09 15:20:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661955075] [2024-11-09 15:20:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:50,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:50,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:50,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:50,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 3 times [2024-11-09 15:20:50,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:50,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371609789] [2024-11-09 15:20:50,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:50,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:50,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:50,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:50,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:50,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 6 times [2024-11-09 15:20:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:50,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944961194] [2024-11-09 15:20:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:50,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-11-09 15:20:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:20:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944961194] [2024-11-09 15:20:50,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944961194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:20:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456147175] [2024-11-09 15:20:50,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:20:50,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:20:50,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:50,227 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-11-09 15:20:50,228 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-11-09 15:20:50,278 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2024-11-09 15:20:50,278 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:20:50,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:20:50,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-11-09 15:20:50,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:20:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-11-09 15:20:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456147175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:20:50,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:20:50,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-11-09 15:20:50,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183784963] [2024-11-09 15:20:50,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:20:50,611 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:50,611 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:50,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:50,612 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:50,612 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:20:50,612 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:50,612 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:50,612 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:50,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-11-09 15:20:50,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:50,612 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:50,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:50,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:50,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:50,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:50,653 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:50,653 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:20:50,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:50,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:50,655 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-11-09 15:20:50,656 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-11-09 15:20:50,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:50,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:50,675 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:50,675 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-11-09 15:20:50,685 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-11-09 15:20:50,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:50,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:50,687 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-11-09 15:20:50,687 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-11-09 15:20:50,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:50,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:50,699 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:20:50,699 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-11-09 15:20:50,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:50,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:50,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:50,712 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-11-09 15:20:50,712 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-11-09 15:20:50,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:20:50,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:50,734 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-11-09 15:20:50,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:50,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:50,736 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-11-09 15:20:50,736 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-11-09 15:20:50,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:20:50,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:20:50,749 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:20:50,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-09 15:20:50,760 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:20:50,760 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:20:50,760 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:20:50,760 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:20:50,760 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:20:50,760 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:50,760 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:20:50,760 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:20:50,760 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-11-09 15:20:50,760 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:20:50,760 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:20:50,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:50,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:50,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:50,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:20:50,799 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:20:50,799 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:20:50,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:50,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:50,800 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-11-09 15:20:50,801 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-11-09 15:20:50,802 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-11-09 15:20:50,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:50,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:50,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:50,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:50,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:20:50,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:20:50,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:50,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-11-09 15:20:50,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:50,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:50,840 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-11-09 15:20:50,841 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-11-09 15:20:50,842 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-11-09 15:20:50,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:50,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:50,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:50,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:50,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:50,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:50,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:50,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:20:50,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:50,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:50,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:50,867 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-11-09 15:20:50,867 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-11-09 15:20:50,868 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-11-09 15:20:50,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:20:50,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:20:50,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:20:50,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:20:50,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:20:50,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:20:50,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:20:50,880 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:20:50,886 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:20:50,886 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:20:50,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:20:50,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:20:50,887 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-11-09 15:20:50,888 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-11-09 15:20:50,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:20:50,889 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:20:50,889 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:20:50,889 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-11-09 15:20:50,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-09 15:20:50,900 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:20:50,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:50,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:50,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:51,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:20:51,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 15:20:51,197 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-11-09 15:20:51,198 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-11-09 15:20:51,245 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-11-09 15:20:51,245 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-11-09 15:20:51,246 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-11-09 15:20:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-09 15:20:51,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2024-11-09 15:20:51,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:51,246 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:51,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:51,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:51,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:51,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:20:51,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 15:20:51,556 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-11-09 15:20:51,556 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-11-09 15:20:51,613 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-11-09 15:20:51,613 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-11-09 15:20:51,614 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-11-09 15:20:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-09 15:20:51,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2024-11-09 15:20:51,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:51,614 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:51,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:51,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:51,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:51,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:20:51,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 15:20:51,916 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-11-09 15:20:51,916 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-11-09 15:20:51,950 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-11-09 15:20:51,951 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-11-09 15:20:51,951 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-11-09 15:20:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-09 15:20:51,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2024-11-09 15:20:51,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:51,952 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:51,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:51,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:51,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:20:52,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:52,150 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-11-09 15:20:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 15:20:52,289 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-11-09 15:20:52,289 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-11-09 15:20:52,354 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-11-09 15:20:52,355 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-11-09 15:20:52,355 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-11-09 15:20:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-11-09 15:20:52,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2024-11-09 15:20:52,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:52,356 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:20:52,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:20:52,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:20:52,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:20:52,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:20:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-09 15:20:52,657 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-11-09 15:20:52,657 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-11-09 15:20:53,113 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-11-09 15:20:53,114 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-11-09 15:20:53,114 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-11-09 15:20:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2024-11-09 15:20:53,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2024-11-09 15:20:53,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:53,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2024-11-09 15:20:53,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:53,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2024-11-09 15:20:53,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:20:53,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11129 states and 19734 transitions. [2024-11-09 15:20:53,207 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2024-11-09 15:20:53,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11129 states to 4882 states and 8741 transitions. [2024-11-09 15:20:53,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2024-11-09 15:20:53,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2024-11-09 15:20:53,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4882 states and 8741 transitions. [2024-11-09 15:20:53,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:53,241 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4882 states and 8741 transitions. [2024-11-09 15:20:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states and 8741 transitions. [2024-11-09 15:20:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3014. [2024-11-09 15:20:53,361 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-11-09 15:20:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 5467 transitions. [2024-11-09 15:20:53,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3014 states and 5467 transitions. [2024-11-09 15:20:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:20:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 15:20:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 15:20:53,374 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-11-09 15:20:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:20:53,432 INFO L93 Difference]: Finished difference Result 3401 states and 6312 transitions. [2024-11-09 15:20:53,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3401 states and 6312 transitions. [2024-11-09 15:20:53,458 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2024-11-09 15:20:53,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3401 states to 3369 states and 6221 transitions. [2024-11-09 15:20:53,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2024-11-09 15:20:53,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2024-11-09 15:20:53,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3369 states and 6221 transitions. [2024-11-09 15:20:53,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:20:53,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3369 states and 6221 transitions. [2024-11-09 15:20:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states and 6221 transitions. [2024-11-09 15:20:53,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3222. [2024-11-09 15:20:53,530 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-11-09 15:20:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 5927 transitions. [2024-11-09 15:20:53,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2024-11-09 15:20:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 15:20:53,540 INFO L425 stractBuchiCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2024-11-09 15:20:53,540 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-09 15:20:53,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3222 states and 5927 transitions. [2024-11-09 15:20:53,552 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2024-11-09 15:20:53,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:20:53,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:20:53,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2024-11-09 15:20:53,554 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2024-11-09 15:20:53,555 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-11-09 15:20:53,555 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-11-09 15:20:53,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 7 times [2024-11-09 15:20:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597615213] [2024-11-09 15:20:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:53,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:53,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:53,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:53,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 4 times [2024-11-09 15:20:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:53,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148250216] [2024-11-09 15:20:53,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:53,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:53,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:53,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:20:53,598 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 8 times [2024-11-09 15:20:53,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:20:53,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904394683] [2024-11-09 15:20:53,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:20:53,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:20:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:53,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:53,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:20:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:54,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:20:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:20:54,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:20:54 BoogieIcfgContainer [2024-11-09 15:20:54,383 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:20:54,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:20:54,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:20:54,384 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:20:54,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:20:41" (3/4) ... [2024-11-09 15:20:54,386 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:20:54,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:20:54,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:20:54,453 INFO L158 Benchmark]: Toolchain (without parser) took 13420.25ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 127.6MB in the beginning and 247.7MB in the end (delta: -120.1MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-09 15:20:54,453 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 184.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:20:54,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.27ms. Allocated memory is still 184.5MB. Free memory was 127.2MB in the beginning and 116.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:20:54,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.44ms. Allocated memory is still 184.5MB. Free memory was 116.2MB in the beginning and 115.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:20:54,454 INFO L158 Benchmark]: Boogie Preprocessor took 25.98ms. Allocated memory is still 184.5MB. Free memory was 115.0MB in the beginning and 113.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:20:54,454 INFO L158 Benchmark]: RCFGBuilder took 247.37ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 104.1MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:20:54,455 INFO L158 Benchmark]: BuchiAutomizer took 12771.74ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 103.7MB in the beginning and 252.9MB in the end (delta: -149.3MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2024-11-09 15:20:54,455 INFO L158 Benchmark]: Witness Printer took 69.40ms. Allocated memory is still 333.4MB. Free memory was 252.9MB in the beginning and 247.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:20:54,456 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.62ms. Allocated memory is still 184.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.27ms. Allocated memory is still 184.5MB. Free memory was 127.2MB in the beginning and 116.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.44ms. Allocated memory is still 184.5MB. Free memory was 116.2MB in the beginning and 115.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.98ms. Allocated memory is still 184.5MB. Free memory was 115.0MB in the beginning and 113.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 247.37ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 104.1MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 12771.74ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 103.7MB in the beginning and 252.9MB in the end (delta: -149.3MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. * Witness Printer took 69.40ms. Allocated memory is still 333.4MB. Free memory was 252.9MB in the beginning and 247.7MB 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 12.6s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 7.1s. Construction of modules took 0.5s. Büchi inclusion checks took 4.4s. 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.7s 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: 86ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s 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-11-09 15:20:54,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2024-11-09 15:20:54,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2024-11-09 15:20:54,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2024-11-09 15:20:55,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2024-11-09 15:20:55,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-09 15:20:55,493 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)