./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 3061b6dc 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:15:17,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:15:17,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:15:17,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:15:17,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:15:17,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:15:17,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:15:17,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:15:17,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:15:17,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:15:17,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:15:17,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:15:17,684 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:15:17,684 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:15:17,684 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:15:17,685 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:15:17,685 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:15:17,685 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:15:17,686 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:15:17,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:15:17,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:15:17,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:15:17,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:15:17,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:15:17,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:15:17,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:15:17,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:15:17,688 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:15:17,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:15:17,692 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:15:17,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:15:17,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:15:17,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:15:17,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:15:17,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:15:17,694 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:15:17,694 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-19 14:15:17,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:15:17,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:15:17,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:15:18,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:15:18,001 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:15:18,002 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-19 14:15:19,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:15:19,651 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:15:19,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-11-19 14:15:19,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc9a0f8fa/1c144b423470421e81b8d3b1c7ba88a7/FLAGbf26ad9ac [2024-11-19 14:15:19,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc9a0f8fa/1c144b423470421e81b8d3b1c7ba88a7 [2024-11-19 14:15:19,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:15:19,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:15:19,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:15:19,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:15:19,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:15:19,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b542a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19, skipping insertion in model container [2024-11-19 14:15:19,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:15:19,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:15:19,901 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:15:19,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:15:19,930 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:15:19,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19 WrapperNode [2024-11-19 14:15:19,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:15:19,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:15:19,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:15:19,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:15:19,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,957 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-19 14:15:19,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:15:19,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:15:19,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:15:19,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:15:19,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,976 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 14:15:19,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:15:19,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:15:19,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:15:19,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:15:19,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (1/1) ... [2024-11-19 14:15:19,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:20,029 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-19 14:15:20,041 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-19 14:15:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:15:20,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:15:20,144 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:15:20,146 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:15:20,203 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-19 14:15:20,203 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:15:20,219 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:15:20,219 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:15:20,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:15:20 BoogieIcfgContainer [2024-11-19 14:15:20,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:15:20,221 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:15:20,221 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:15:20,224 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:15:20,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:15:20,225 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:15:19" (1/3) ... [2024-11-19 14:15:20,226 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@be442ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:15:20, skipping insertion in model container [2024-11-19 14:15:20,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:15:20,227 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:19" (2/3) ... [2024-11-19 14:15:20,227 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@be442ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:15:20, skipping insertion in model container [2024-11-19 14:15:20,228 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:15:20,228 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:15:20" (3/3) ... [2024-11-19 14:15:20,231 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2024-11-19 14:15:20,296 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:15:20,297 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:15:20,297 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:15:20,297 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:15:20,298 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:15:20,298 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:15:20,298 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:15:20,299 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:15:20,303 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-19 14:15:20,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:20,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:20,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:20,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:15:20,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:15:20,340 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:15:20,341 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-19 14:15:20,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:20,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:20,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:20,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:15:20,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:15:20,352 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-19 14:15:20,352 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-19 14:15:20,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:15:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:20,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185875631] [2024-11-19 14:15:20,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:20,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:20,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:20,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-11-19 14:15:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127736873] [2024-11-19 14:15:20,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:20,527 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-19 14:15:20,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127736873] [2024-11-19 14:15:20,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127736873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:20,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:15:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:15:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717591271] [2024-11-19 14:15:20,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:20,533 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:20,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:15:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:15:20,569 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-19 14:15:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:20,590 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2024-11-19 14:15:20,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2024-11-19 14:15:20,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:15:20,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 10 states and 15 transitions. [2024-11-19 14:15:20,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:15:20,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:15:20,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2024-11-19 14:15:20,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:15:20,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-11-19 14:15:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2024-11-19 14:15:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-19 14:15:20,618 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-19 14:15:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2024-11-19 14:15:20,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-11-19 14:15:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:15:20,628 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-11-19 14:15:20,629 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:15:20,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2024-11-19 14:15:20,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:15:20,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:20,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:20,632 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:15:20,632 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:15:20,632 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-19 14:15:20,633 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-19 14:15:20,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:20,635 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:15:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767564849] [2024-11-19 14:15:20,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:20,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:20,644 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:15:20,646 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:20,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:20,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:20,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2024-11-19 14:15:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:20,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225284211] [2024-11-19 14:15:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:20,688 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-19 14:15:20,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:20,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225284211] [2024-11-19 14:15:20,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225284211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:20,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:15:20,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:15:20,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188607831] [2024-11-19 14:15:20,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:20,694 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:20,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:20,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:15:20,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:15:20,695 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-19 14:15:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:20,729 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2024-11-19 14:15:20,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2024-11-19 14:15:20,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:15:20,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2024-11-19 14:15:20,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-19 14:15:20,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-19 14:15:20,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2024-11-19 14:15:20,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:15:20,732 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-11-19 14:15:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2024-11-19 14:15:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-19 14:15:20,735 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-19 14:15:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2024-11-19 14:15:20,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-11-19 14:15:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:15:20,738 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-11-19 14:15:20,738 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:15:20,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2024-11-19 14:15:20,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:15:20,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:20,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:20,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:15:20,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:15:20,741 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-19 14:15:20,742 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-19 14:15:20,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:15:20,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:20,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316539969] [2024-11-19 14:15:20,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:20,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:20,752 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:15:20,752 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:20,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:20,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:20,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2024-11-19 14:15:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265787264] [2024-11-19 14:15:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:20,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:20,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:20,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2024-11-19 14:15:20,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:20,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114408174] [2024-11-19 14:15:20,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:20,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:20,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:20,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:20,860 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:20,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:20,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:20,861 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:20,861 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:20,861 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:20,861 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:20,861 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:20,861 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2024-11-19 14:15:20,861 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:20,861 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:20,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:20,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:20,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:20,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:20,979 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:20,980 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:20,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:20,993 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-19 14:15:20,995 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-19 14:15:20,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:20,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:21,017 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:21,018 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-19 14:15:21,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:15:21,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,034 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-19 14:15:21,035 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-19 14:15:21,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:21,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:21,055 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:21,055 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-19 14:15:21,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:21,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,069 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-19 14:15:21,070 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-19 14:15:21,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:21,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:21,096 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:21,096 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-19 14:15:21,112 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-19 14:15:21,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,116 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-19 14:15:21,118 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-19 14:15:21,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:21,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:21,150 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-19 14:15:21,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,152 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-19 14:15:21,154 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-19 14:15:21,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:21,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:21,178 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:21,193 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-19 14:15:21,194 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:21,194 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:21,195 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:21,195 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:21,195 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:21,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:21,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:21,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2024-11-19 14:15:21,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:21,196 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:21,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,269 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:21,273 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:21,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,276 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-19 14:15:21,277 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-19 14:15:21,279 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-19 14:15:21,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:21,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:21,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:21,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:21,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:21,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:21,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:21,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 14:15:21,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,327 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-19 14:15:21,328 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-19 14:15:21,330 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-19 14:15:21,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:21,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:21,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:21,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:21,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:21,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:21,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:21,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:21,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,374 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-19 14:15:21,375 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-19 14:15:21,376 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-19 14:15:21,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:21,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:21,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:21,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:21,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:21,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:21,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:21,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:21,395 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:21,395 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:15:21,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,398 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-19 14:15:21,400 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-19 14:15:21,401 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:21,401 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:21,401 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:21,401 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-19 14:15:21,416 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-19 14:15:21,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:21,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:21,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:21,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:21,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:21,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:21,479 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-19 14:15:21,483 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-19 14:15:21,484 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-19 14:15:21,532 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-19 14:15:21,533 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-19 14:15:21,534 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-19 14:15:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-19 14:15:21,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-19 14:15:21,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:21,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-19 14:15:21,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:21,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-19 14:15:21,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:21,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2024-11-19 14:15:21,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2024-11-19 14:15:21,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2024-11-19 14:15:21,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-19 14:15:21,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-19 14:15:21,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2024-11-19 14:15:21,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:21,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2024-11-19 14:15:21,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2024-11-19 14:15:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-19 14:15:21,549 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-19 14:15:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-11-19 14:15:21,550 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-19 14:15:21,550 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-19 14:15:21,551 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:15:21,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2024-11-19 14:15:21,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-11-19 14:15:21,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:21,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:21,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:15:21,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:15:21,554 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-19 14:15:21,554 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-19 14:15:21,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-11-19 14:15:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:21,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75675293] [2024-11-19 14:15:21,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:21,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:21,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:21,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:21,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:21,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2024-11-19 14:15:21,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:21,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390239868] [2024-11-19 14:15:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:21,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:21,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:21,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:21,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2024-11-19 14:15:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:21,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336399676] [2024-11-19 14:15:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:21,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:21,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:21,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:21,660 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:21,660 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:21,660 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:21,660 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:21,661 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:21,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,661 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:21,661 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:21,661 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-11-19 14:15:21,661 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:21,661 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:21,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,764 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:21,764 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:21,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,766 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-19 14:15:21,767 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-19 14:15:21,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:21,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:21,789 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:21,790 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-19 14:15:21,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:21,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,806 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-19 14:15:21,808 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-19 14:15:21,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:21,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:21,843 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-19 14:15:21,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:21,845 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-19 14:15:21,847 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-19 14:15:21,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:21,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:21,925 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:21,930 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-19 14:15:21,930 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:21,930 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:21,930 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:21,930 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:21,930 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:21,931 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:21,931 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:21,931 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:21,931 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-11-19 14:15:21,931 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:21,931 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:21,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:21,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,046 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:22,047 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:22,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,049 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-19 14:15:22,051 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-19 14:15:22,052 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-19 14:15:22,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:22,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:22,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:22,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:22,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:22,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:22,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:22,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,086 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-19 14:15:22,089 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-19 14:15:22,090 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-19 14:15:22,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:22,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:22,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:22,103 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:15:22,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:22,107 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 14:15:22,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:22,114 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:22,133 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-19 14:15:22,133 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:22,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,138 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-19 14:15:22,147 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:22,147 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:22,147 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:22,147 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-19 14:15:22,147 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-19 14:15:22,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:22,162 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-19 14:15:22,163 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:22,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:22,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:22,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:22,194 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:22,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:22,234 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-19 14:15:22,235 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-19 14:15:22,236 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-19 14:15:22,271 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-19 14:15:22,272 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-19 14:15:22,273 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-19 14:15:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-19 14:15:22,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-19 14:15:22,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:22,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2024-11-19 14:15:22,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:22,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2024-11-19 14:15:22,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:22,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2024-11-19 14:15:22,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:15:22,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2024-11-19 14:15:22,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-19 14:15:22,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-19 14:15:22,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2024-11-19 14:15:22,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:22,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-11-19 14:15:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2024-11-19 14:15:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 14:15:22,285 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-19 14:15:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2024-11-19 14:15:22,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-11-19 14:15:22,289 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-11-19 14:15:22,289 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:15:22,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2024-11-19 14:15:22,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:15:22,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:22,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:22,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:15:22,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:15:22,291 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-19 14:15:22,291 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-19 14:15:22,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2024-11-19 14:15:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:22,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367871603] [2024-11-19 14:15:22,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:22,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:22,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:22,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:22,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2024-11-19 14:15:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:22,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727164210] [2024-11-19 14:15:22,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:22,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:22,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:22,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:22,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2024-11-19 14:15:22,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:22,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763648407] [2024-11-19 14:15:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:22,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:22,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:22,381 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:22,381 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:22,381 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:22,381 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:22,381 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:22,382 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,382 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:22,382 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:22,382 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2024-11-19 14:15:22,382 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:22,382 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:22,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,492 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:22,492 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:22,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,494 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-19 14:15:22,496 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-19 14:15:22,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,525 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-19 14:15:22,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,527 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-19 14:15:22,529 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-19 14:15:22,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:22,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,565 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:22,565 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-19 14:15:22,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:15:22,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,580 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-19 14:15:22,581 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-19 14:15:22,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,603 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:22,603 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-19 14:15:22,614 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-19 14:15:22,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,615 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-19 14:15:22,616 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-19 14:15:22,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,628 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:22,628 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-19 14:15:22,638 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-19 14:15:22,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,640 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-19 14:15:22,641 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-19 14:15:22,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,660 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:22,660 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-19 14:15:22,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-19 14:15:22,697 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:22,697 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:22,697 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:22,698 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:22,698 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:22,698 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,698 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:22,698 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:22,698 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2024-11-19 14:15:22,698 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:22,698 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:22,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:22,817 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:22,818 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:22,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,820 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-19 14:15:22,821 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-19 14:15:22,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,837 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:22,837 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-19 14:15:22,851 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-19 14:15:22,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,853 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-19 14:15:22,854 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-19 14:15:22,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,870 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:22,870 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-19 14:15:22,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:22,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,886 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-19 14:15:22,887 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-19 14:15:22,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,910 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:22,911 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-19 14:15:22,920 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-19 14:15:22,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,922 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-19 14:15:22,923 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-19 14:15:22,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,937 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:22,937 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-19 14:15:22,947 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-19 14:15:22,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,948 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-19 14:15:22,949 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-19 14:15:22,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:22,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:22,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-19 14:15:22,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:22,977 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-19 14:15:22,978 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-19 14:15:22,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:22,979 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:23,010 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:23,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:23,015 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:23,015 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:23,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:23,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:23,016 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:23,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:23,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:23,016 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2024-11-19 14:15:23,016 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:23,016 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:23,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,150 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:23,150 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:23,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:23,154 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-19 14:15:23,156 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-19 14:15:23,157 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-19 14:15:23,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:23,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:23,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:23,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:23,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:23,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:23,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:23,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:23,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:23,189 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-19 14:15:23,190 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-19 14:15:23,190 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-19 14:15:23,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:23,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:23,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:23,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:23,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:23,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:23,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:23,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:23,213 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-19 14:15:23,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:23,215 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-19 14:15:23,216 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-19 14:15:23,217 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-19 14:15:23,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:23,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:23,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:23,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:23,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:23,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:23,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:23,247 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-19 14:15:23,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:23,250 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-19 14:15:23,251 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-19 14:15:23,252 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-19 14:15:23,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:23,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:23,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:23,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:23,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:23,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:23,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:23,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:23,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:23,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:23,275 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-19 14:15:23,276 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-19 14:15:23,277 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-19 14:15:23,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:23,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:23,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:23,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:23,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:23,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:23,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:23,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:23,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:23,323 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-19 14:15:23,324 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-19 14:15:23,325 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-19 14:15:23,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:23,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:23,337 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:15:23,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:23,343 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-19 14:15:23,343 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-19 14:15:23,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:23,379 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-19 14:15:23,379 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-19 14:15:23,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:23,382 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-19 14:15:23,383 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-19 14:15:23,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:23,400 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-11-19 14:15:23,400 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:23,400 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-19 14:15:23,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-19 14:15:23,420 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-11-19 14:15:23,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:23,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:23,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:23,489 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:23,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:23,531 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-19 14:15:23,532 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-19 14:15:23,532 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-19 14:15:23,599 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-19 14:15:23,599 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-19 14:15:23,600 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-19 14:15:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-11-19 14:15:23,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-19 14:15:23,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:23,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-19 14:15:23,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:23,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2024-11-19 14:15:23,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:23,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2024-11-19 14:15:23,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:15:23,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2024-11-19 14:15:23,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-19 14:15:23,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-19 14:15:23,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2024-11-19 14:15:23,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:23,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-11-19 14:15:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2024-11-19 14:15:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-19 14:15:23,607 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-19 14:15:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2024-11-19 14:15:23,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 64 transitions. [2024-11-19 14:15:23,608 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2024-11-19 14:15:23,608 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:15:23,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2024-11-19 14:15:23,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:15:23,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:23,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:23,611 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:15:23,612 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:15:23,612 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-19 14:15:23,612 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-19 14:15:23,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:23,613 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2024-11-19 14:15:23,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:23,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523123218] [2024-11-19 14:15:23,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:23,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:23,666 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-19 14:15:23,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523123218] [2024-11-19 14:15:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523123218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447348634] [2024-11-19 14:15:23,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:23,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:23,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:23,669 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-19 14:15:23,670 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-19 14:15:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:23,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:15:23,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:23,706 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-19 14:15:23,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:23,740 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-19 14:15:23,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447348634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:23,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:23,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 14:15:23,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058460901] [2024-11-19 14:15:23,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:23,741 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:23,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2024-11-19 14:15:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:23,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313209556] [2024-11-19 14:15:23,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:23,746 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:15:23,746 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:23,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:23,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:23,781 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:23,781 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:23,781 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:23,781 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:23,781 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:23,781 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,781 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:23,781 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:23,781 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2024-11-19 14:15:23,781 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:23,781 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:23,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:23,875 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:23,876 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:23,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:23,878 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-19 14:15:23,880 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-19 14:15:23,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:23,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:23,893 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-19 14:15:23,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:23,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:23,914 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-19 14:15:23,915 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-19 14:15:23,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:23,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:23,932 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:23,946 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-19 14:15:23,947 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:23,947 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:23,947 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:23,947 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:23,947 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:23,947 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:23,947 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:23,947 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:23,947 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2024-11-19 14:15:23,947 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:23,947 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:23,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:23,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,012 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:24,013 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:24,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,017 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-19 14:15:24,019 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-19 14:15:24,019 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-19 14:15:24,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:24,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:24,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:24,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:24,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:24,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:24,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:24,035 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:24,039 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-19 14:15:24,039 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:24,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,041 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-19 14:15:24,042 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-19 14:15:24,042 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:24,042 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:24,042 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:24,042 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-19 14:15:24,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:24,053 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:24,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:24,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:24,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:24,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:24,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:24,115 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-19 14:15:24,115 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:15:24,116 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-19 14:15:24,145 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-19 14:15:24,146 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-19 14:15:24,146 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-19 14:15:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-19 14:15:24,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-19 14:15:24,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:24,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2024-11-19 14:15:24,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:24,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2024-11-19 14:15:24,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:24,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2024-11-19 14:15:24,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-11-19 14:15:24,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2024-11-19 14:15:24,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-19 14:15:24,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-11-19 14:15:24,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2024-11-19 14:15:24,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:24,153 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-11-19 14:15:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2024-11-19 14:15:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-11-19 14:15:24,162 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-19 14:15:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-11-19 14:15:24,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-11-19 14:15:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:15:24,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:15:24,165 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-19 14:15:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:24,212 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2024-11-19 14:15:24,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2024-11-19 14:15:24,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-11-19 14:15:24,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2024-11-19 14:15:24,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2024-11-19 14:15:24,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-19 14:15:24,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2024-11-19 14:15:24,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:24,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 239 transitions. [2024-11-19 14:15:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2024-11-19 14:15:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2024-11-19 14:15:24,224 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-19 14:15:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2024-11-19 14:15:24,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-11-19 14:15:24,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:15:24,227 INFO L425 stractBuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-11-19 14:15:24,227 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:15:24,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2024-11-19 14:15:24,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-11-19 14:15:24,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:24,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:24,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-19 14:15:24,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:15:24,229 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-19 14:15:24,230 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-19 14:15:24,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:24,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2024-11-19 14:15:24,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:24,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083573604] [2024-11-19 14:15:24,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:24,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:24,269 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-19 14:15:24,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:24,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083573604] [2024-11-19 14:15:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083573604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:15:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:15:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914727353] [2024-11-19 14:15:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:24,270 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:24,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:24,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2024-11-19 14:15:24,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:24,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670554147] [2024-11-19 14:15:24,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:24,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:24,275 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:15:24,275 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:24,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:24,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:24,303 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:24,303 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:24,303 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:24,304 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:24,304 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:24,304 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,304 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:24,304 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:24,304 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-11-19 14:15:24,304 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:24,304 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:24,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,394 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:24,394 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:24,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,396 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-19 14:15:24,399 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-19 14:15:24,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:24,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:24,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:24,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,422 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-19 14:15:24,423 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-19 14:15:24,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:24,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:24,466 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:24,470 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-19 14:15:24,470 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:24,470 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:24,471 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:24,471 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:24,471 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:24,471 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,471 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:24,471 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:24,471 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-11-19 14:15:24,471 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:24,471 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:24,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,569 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:24,569 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:24,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,571 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-19 14:15:24,574 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-19 14:15:24,576 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-19 14:15:24,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:24,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:24,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:24,585 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:15:24,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:24,586 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 14:15:24,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:24,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:24,592 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-19 14:15:24,592 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:24,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,594 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-19 14:15:24,595 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-19 14:15:24,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:24,596 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:24,596 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:24,596 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-19 14:15:24,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:24,612 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:24,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:24,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:24,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:24,646 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:24,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:24,668 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-19 14:15:24,669 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-19 14:15:24,669 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-19 14:15:24,695 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-19 14:15:24,695 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-19 14:15:24,696 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-19 14:15:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-19 14:15:24,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-19 14:15:24,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:24,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-19 14:15:24,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:24,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2024-11-19 14:15:24,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:24,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2024-11-19 14:15:24,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-11-19 14:15:24,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2024-11-19 14:15:24,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2024-11-19 14:15:24,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2024-11-19 14:15:24,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2024-11-19 14:15:24,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:24,702 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224 states and 333 transitions. [2024-11-19 14:15:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2024-11-19 14:15:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2024-11-19 14:15:24,709 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-19 14:15:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2024-11-19 14:15:24,711 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 304 transitions. [2024-11-19 14:15:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:24,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:15:24,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:15:24,711 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-19 14:15:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:24,731 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2024-11-19 14:15:24,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2024-11-19 14:15:24,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2024-11-19 14:15:24,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2024-11-19 14:15:24,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2024-11-19 14:15:24,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-11-19 14:15:24,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2024-11-19 14:15:24,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:24,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 313 transitions. [2024-11-19 14:15:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2024-11-19 14:15:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2024-11-19 14:15:24,743 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-19 14:15:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2024-11-19 14:15:24,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-11-19 14:15:24,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:15:24,745 INFO L425 stractBuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-11-19 14:15:24,745 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:15:24,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2024-11-19 14:15:24,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-11-19 14:15:24,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:24,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:24,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:15:24,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:15:24,747 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-19 14:15:24,747 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-19 14:15:24,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1454758974, now seen corresponding path program 1 times [2024-11-19 14:15:24,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373246672] [2024-11-19 14:15:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:24,783 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-19 14:15:24,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:24,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373246672] [2024-11-19 14:15:24,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373246672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:24,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:15:24,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:15:24,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331244192] [2024-11-19 14:15:24,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:24,784 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:24,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2024-11-19 14:15:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:24,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200207799] [2024-11-19 14:15:24,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:24,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:24,788 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:15:24,788 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:24,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:24,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:24,817 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:24,817 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:24,817 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:24,817 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:24,817 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:24,817 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,817 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:24,817 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:24,817 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-11-19 14:15:24,817 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:24,817 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:24,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:24,915 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:24,919 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:24,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,921 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-19 14:15:24,922 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-19 14:15:24,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:24,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:24,944 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:24,944 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-19 14:15:24,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:24,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,957 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-19 14:15:24,958 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-19 14:15:24,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:24,958 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:24,976 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:24,976 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-19 14:15:24,986 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-19 14:15:24,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:24,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:24,987 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-19 14:15:24,988 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-19 14:15:24,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:24,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:25,007 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:25,007 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-19 14:15:25,018 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-19 14:15:25,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:25,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:25,019 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-19 14:15:25,020 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-19 14:15:25,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:25,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:25,042 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-19 14:15:25,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:25,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:25,043 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-19 14:15:25,044 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-19 14:15:25,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:25,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:25,076 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:25,080 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-19 14:15:25,080 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:25,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:25,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:25,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:25,080 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:25,080 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:25,080 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:25,080 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:25,080 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-11-19 14:15:25,080 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:25,080 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:25,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:25,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:25,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:25,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:25,170 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:25,170 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:25,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:25,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:25,171 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-19 14:15:25,172 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-19 14:15:25,173 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-19 14:15:25,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:25,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:25,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:25,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:25,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:25,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:25,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:25,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:25,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:25,204 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-19 14:15:25,205 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-19 14:15:25,206 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-19 14:15:25,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:25,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:25,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:25,218 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:15:25,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:25,219 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 14:15:25,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:25,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:25,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-19 14:15:25,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:25,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:25,235 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-19 14:15:25,235 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-19 14:15:25,236 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-19 14:15:25,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:25,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:25,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:25,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:25,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:25,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:25,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:25,264 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-19 14:15:25,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:25,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:25,267 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-19 14:15:25,268 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-19 14:15:25,269 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-19 14:15:25,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:25,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:25,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:25,281 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:15:25,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:25,283 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 14:15:25,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:25,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:25,289 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-19 14:15:25,289 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:25,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:25,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:25,291 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-19 14:15:25,292 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-19 14:15:25,293 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:25,293 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:25,293 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:25,293 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-19 14:15:25,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:25,308 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:25,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:25,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:25,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:25,361 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:25,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:25,384 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-19 14:15:25,385 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-19 14:15:25,385 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-19 14:15:25,418 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-19 14:15:25,419 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-19 14:15:25,420 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-19 14:15:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-19 14:15:25,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-19 14:15:25,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:25,421 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:25,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:25,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:25,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:25,467 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:25,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:25,485 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-19 14:15:25,486 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-19 14:15:25,486 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-19 14:15:25,508 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-19 14:15:25,509 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-19 14:15:25,510 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-19 14:15:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-19 14:15:25,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-19 14:15:25,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:25,510 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:25,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:25,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:25,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:25,548 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:25,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:25,570 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-19 14:15:25,570 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-19 14:15:25,571 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-19 14:15:25,610 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-19 14:15:25,622 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-19 14:15:25,632 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-19 14:15:25,637 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-19 14:15:25,638 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-19 14:15:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-11-19 14:15:25,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-19 14:15:25,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:25,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2024-11-19 14:15:25,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:25,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2024-11-19 14:15:25,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:25,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2024-11-19 14:15:25,644 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-11-19 14:15:25,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2024-11-19 14:15:25,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2024-11-19 14:15:25,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-11-19 14:15:25,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2024-11-19 14:15:25,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:25,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 268 states and 378 transitions. [2024-11-19 14:15:25,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2024-11-19 14:15:25,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2024-11-19 14:15:25,656 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-19 14:15:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2024-11-19 14:15:25,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 234 transitions. [2024-11-19 14:15:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:25,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:15:25,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:15:25,658 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-19 14:15:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:25,686 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2024-11-19 14:15:25,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 246 transitions. [2024-11-19 14:15:25,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2024-11-19 14:15:25,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 177 states and 243 transitions. [2024-11-19 14:15:25,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-11-19 14:15:25,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2024-11-19 14:15:25,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 243 transitions. [2024-11-19 14:15:25,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:25,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 177 states and 243 transitions. [2024-11-19 14:15:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 243 transitions. [2024-11-19 14:15:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2024-11-19 14:15:25,693 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-19 14:15:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2024-11-19 14:15:25,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 234 transitions. [2024-11-19 14:15:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:15:25,700 INFO L425 stractBuchiCegarLoop]: Abstraction has 170 states and 234 transitions. [2024-11-19 14:15:25,700 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:15:25,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 234 transitions. [2024-11-19 14:15:25,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2024-11-19 14:15:25,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:25,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:25,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:15:25,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2024-11-19 14:15:25,702 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-19 14:15:25,702 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-19 14:15:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497813, now seen corresponding path program 1 times [2024-11-19 14:15:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:25,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601730009] [2024-11-19 14:15:25,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:25,722 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-19 14:15:25,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:25,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601730009] [2024-11-19 14:15:25,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601730009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:25,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:15:25,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:15:25,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170111014] [2024-11-19 14:15:25,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:25,723 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:25,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2142023595, now seen corresponding path program 1 times [2024-11-19 14:15:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866698844] [2024-11-19 14:15:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:25,748 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-19 14:15:25,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:25,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866698844] [2024-11-19 14:15:25,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866698844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:25,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:15:25,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:15:25,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189113499] [2024-11-19 14:15:25,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:25,749 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:15:25,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:15:25,749 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-19 14:15:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:25,756 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-11-19 14:15:25,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 118 transitions. [2024-11-19 14:15:25,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-19 14:15:25,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 84 states and 95 transitions. [2024-11-19 14:15:25,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-19 14:15:25,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-19 14:15:25,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 95 transitions. [2024-11-19 14:15:25,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:25,758 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-11-19 14:15:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 95 transitions. [2024-11-19 14:15:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-19 14:15:25,760 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-19 14:15:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2024-11-19 14:15:25,760 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-11-19 14:15:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:15:25,763 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-11-19 14:15:25,763 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:15:25,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 93 transitions. [2024-11-19 14:15:25,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-11-19 14:15:25,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:25,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:25,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 1, 1, 1, 1] [2024-11-19 14:15:25,765 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2024-11-19 14:15:25,765 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-19 14:15:25,765 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-19 14:15:25,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash -608617554, now seen corresponding path program 2 times [2024-11-19 14:15:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:25,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642016084] [2024-11-19 14:15:25,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:25,780 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:25,780 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:25,854 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-19 14:15:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642016084] [2024-11-19 14:15:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642016084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694119337] [2024-11-19 14:15:25,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:25,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:25,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:25,856 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-19 14:15:25,858 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-19 14:15:25,890 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:25,890 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:25,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:25,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:25,920 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-19 14:15:25,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:25,999 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-19 14:15:25,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694119337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:25,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:26,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-19 14:15:26,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358287625] [2024-11-19 14:15:26,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:26,000 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:26,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1118663673, now seen corresponding path program 1 times [2024-11-19 14:15:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163283276] [2024-11-19 14:15:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:26,069 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-19 14:15:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163283276] [2024-11-19 14:15:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163283276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703328365] [2024-11-19 14:15:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:26,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:26,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,072 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-19 14:15:26,073 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-19 14:15:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:26,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:26,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:26,128 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-19 14:15:26,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:26,191 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-19 14:15:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703328365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:26,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:26,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-19 14:15:26,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367984693] [2024-11-19 14:15:26,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:26,193 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:15:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:26,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 14:15:26,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-19 14:15:26,194 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-19 14:15:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:26,240 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2024-11-19 14:15:26,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 180 transitions. [2024-11-19 14:15:26,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-19 14:15:26,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 160 transitions. [2024-11-19 14:15:26,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-19 14:15:26,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-19 14:15:26,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 160 transitions. [2024-11-19 14:15:26,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:26,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 160 transitions. [2024-11-19 14:15:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 160 transitions. [2024-11-19 14:15:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2024-11-19 14:15:26,244 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-19 14:15:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2024-11-19 14:15:26,245 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-11-19 14:15:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 14:15:26,245 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-11-19 14:15:26,246 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:15:26,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 153 transitions. [2024-11-19 14:15:26,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2024-11-19 14:15:26,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:26,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:26,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2024-11-19 14:15:26,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2024-11-19 14:15:26,250 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-19 14:15:26,250 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-19 14:15:26,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 3 times [2024-11-19 14:15:26,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:26,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026910039] [2024-11-19 14:15:26,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:26,264 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-19 14:15:26,265 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:26,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:26,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:26,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 2 times [2024-11-19 14:15:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:26,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407808733] [2024-11-19 14:15:26,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:26,284 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:26,284 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:26,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:26,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:26,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 4 times [2024-11-19 14:15:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933875955] [2024-11-19 14:15:26,292 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:26,304 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:26,305 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:26,392 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-19 14:15:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933875955] [2024-11-19 14:15:26,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933875955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007408213] [2024-11-19 14:15:26,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:26,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:26,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,395 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-19 14:15:26,396 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-19 14:15:26,443 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:26,443 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:26,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:26,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:26,465 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-19 14:15:26,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:26,504 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-19 14:15:26,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007408213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:26,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:26,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-19 14:15:26,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667779334] [2024-11-19 14:15:26,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:26,649 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:26,649 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:26,649 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:26,649 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:26,649 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:26,650 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,650 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:26,650 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:26,650 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-11-19 14:15:26,650 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:26,650 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:26,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,694 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:26,694 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:26,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,696 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-19 14:15:26,697 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-19 14:15:26,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:26,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:26,720 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:26,720 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-19 14:15:26,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-19 14:15:26,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,736 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-19 14:15:26,738 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-19 14:15:26,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:26,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:26,760 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:26,760 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-19 14:15:26,774 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-19 14:15:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,776 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-19 14:15:26,777 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-19 14:15:26,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:26,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:26,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-19 14:15:26,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,808 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-19 14:15:26,809 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-19 14:15:26,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:26,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:26,821 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:26,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-19 14:15:26,831 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:26,831 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:26,831 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:26,831 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:26,831 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:26,831 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,831 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:26,831 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:26,831 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-11-19 14:15:26,831 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:26,831 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:26,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:26,882 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:26,882 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:26,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,885 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-19 14:15:26,886 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-19 14:15:26,887 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-19 14:15:26,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:26,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:26,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:26,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:26,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:26,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:26,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:26,918 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-19 14:15:26,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,919 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-19 14:15:26,920 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-19 14:15:26,923 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-19 14:15:26,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:26,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:26,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:26,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:26,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:26,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:26,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:26,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:26,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,955 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-19 14:15:26,955 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-19 14:15:26,956 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-19 14:15:26,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:26,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:26,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:26,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:26,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:26,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:26,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:26,968 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:26,970 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:26,970 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:26,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:26,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:26,971 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-19 14:15:26,972 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-19 14:15:26,972 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:26,972 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:26,972 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:26,972 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-19 14:15:26,982 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-19 14:15:26,983 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:26,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:27,018 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-19 14:15:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:27,208 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-19 14:15:27,209 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-19 14:15:27,209 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-19 14:15:27,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 228 states and 242 transitions. Complement of second has 7 states. [2024-11-19 14:15:27,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-19 14:15:27,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-19 14:15:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:15:27,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2024-11-19 14:15:27,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:27,245 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:27,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:27,436 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-19 14:15:27,437 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-19 14:15:27,437 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-19 14:15:27,495 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-19 14:15:27,496 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-19 14:15:27,497 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-19 14:15:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-19 14:15:27,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2024-11-19 14:15:27,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:27,497 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:27,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:27,667 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-19 14:15:27,667 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-19 14:15:27,667 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-19 14:15:27,694 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-19 14:15:27,694 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-19 14:15:27,694 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-19 14:15:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-19 14:15:27,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2024-11-19 14:15:27,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:27,697 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:27,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:27,851 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-19 14:15:27,852 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-19 14:15:27,852 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-19 14:15:27,919 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-19 14:15:27,919 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-19 14:15:27,920 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-19 14:15:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-11-19 14:15:27,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2024-11-19 14:15:27,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:27,923 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:27,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:27,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:27,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:28,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:28,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:28,111 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-19 14:15:28,111 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-19 14:15:28,112 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-19 14:15:28,310 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-19 14:15:28,311 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-19 14:15:28,311 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-19 14:15:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2024-11-19 14:15:28,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2024-11-19 14:15:28,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:28,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2024-11-19 14:15:28,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:28,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2024-11-19 14:15:28,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:28,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1899 states and 2480 transitions. [2024-11-19 14:15:28,340 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2024-11-19 14:15:28,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1899 states to 956 states and 1245 transitions. [2024-11-19 14:15:28,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2024-11-19 14:15:28,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2024-11-19 14:15:28,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1245 transitions. [2024-11-19 14:15:28,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:28,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1245 transitions. [2024-11-19 14:15:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1245 transitions. [2024-11-19 14:15:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 564. [2024-11-19 14:15:28,355 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-19 14:15:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 787 transitions. [2024-11-19 14:15:28,357 INFO L240 hiAutomatonCegarLoop]: Abstraction has 564 states and 787 transitions. [2024-11-19 14:15:28,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:28,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 14:15:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:15:28,358 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-19 14:15:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:28,401 INFO L93 Difference]: Finished difference Result 692 states and 978 transitions. [2024-11-19 14:15:28,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 978 transitions. [2024-11-19 14:15:28,404 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2024-11-19 14:15:28,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 675 states and 954 transitions. [2024-11-19 14:15:28,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-11-19 14:15:28,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2024-11-19 14:15:28,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 954 transitions. [2024-11-19 14:15:28,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:28,408 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 954 transitions. [2024-11-19 14:15:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 954 transitions. [2024-11-19 14:15:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 634. [2024-11-19 14:15:28,416 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-19 14:15:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 895 transitions. [2024-11-19 14:15:28,418 INFO L240 hiAutomatonCegarLoop]: Abstraction has 634 states and 895 transitions. [2024-11-19 14:15:28,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 14:15:28,419 INFO L425 stractBuchiCegarLoop]: Abstraction has 634 states and 895 transitions. [2024-11-19 14:15:28,419 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 14:15:28,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 895 transitions. [2024-11-19 14:15:28,422 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2024-11-19 14:15:28,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:28,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:28,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2024-11-19 14:15:28,424 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2024-11-19 14:15:28,424 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-19 14:15:28,424 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-19 14:15:28,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:28,425 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 5 times [2024-11-19 14:15:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:28,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863279106] [2024-11-19 14:15:28,425 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:28,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:28,436 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-11-19 14:15:28,436 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:28,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:28,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:28,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 3 times [2024-11-19 14:15:28,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:28,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989893715] [2024-11-19 14:15:28,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:28,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:28,453 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-19 14:15:28,454 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:28,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:28,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:28,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 6 times [2024-11-19 14:15:28,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:28,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639779106] [2024-11-19 14:15:28,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:28,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:28,476 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2024-11-19 14:15:28,476 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:28,613 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-19 14:15:28,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639779106] [2024-11-19 14:15:28,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639779106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218089435] [2024-11-19 14:15:28,614 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:28,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:28,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:28,616 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-19 14:15:28,617 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-19 14:15:28,670 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2024-11-19 14:15:28,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:28,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:15:28,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:28,710 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-19 14:15:28,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:28,786 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-19 14:15:28,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218089435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:28,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:28,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-11-19 14:15:28,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590067489] [2024-11-19 14:15:28,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:28,990 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:28,990 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:28,990 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:28,990 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:28,990 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:28,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:28,990 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:28,990 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:28,990 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-11-19 14:15:28,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:28,990 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:28,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:28,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:28,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:29,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:29,033 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:29,033 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:29,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:29,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:29,035 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-19 14:15:29,035 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-19 14:15:29,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:29,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:29,053 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:29,054 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-19 14:15:29,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:29,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:29,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:29,066 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-19 14:15:29,067 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-19 14:15:29,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:29,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:29,078 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:29,079 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-19 14:15:29,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-19 14:15:29,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:29,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:29,090 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-19 14:15:29,091 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-19 14:15:29,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:29,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:29,112 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-19 14:15:29,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:29,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:29,113 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-19 14:15:29,114 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-19 14:15:29,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:29,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:29,126 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:29,136 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-19 14:15:29,136 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:29,136 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:29,136 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:29,136 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:29,136 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:29,136 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:29,136 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:29,136 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:29,136 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-11-19 14:15:29,136 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:29,136 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:29,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:29,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:29,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:29,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:29,177 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:29,178 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:29,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:29,179 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-19 14:15:29,180 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-19 14:15:29,180 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-19 14:15:29,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:29,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:29,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:29,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:29,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:29,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:29,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:29,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:29,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:29,205 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-19 14:15:29,205 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-19 14:15:29,206 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-19 14:15:29,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:29,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:29,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:29,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:29,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:29,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:29,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:29,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:29,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-11-19 14:15:29,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:29,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:29,229 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-19 14:15:29,230 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-19 14:15:29,230 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-19 14:15:29,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:29,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:29,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:29,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:29,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:29,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:29,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:29,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:29,245 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:29,245 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:29,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:29,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:29,247 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-19 14:15:29,248 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-19 14:15:29,248 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:29,248 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:29,248 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:29,248 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-19 14:15:29,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-11-19 14:15:29,259 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:29,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:29,301 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-19 14:15:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:29,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:29,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:29,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:15:29,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:29,550 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-19 14:15:29,551 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-19 14:15:29,551 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-19 14:15:29,584 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-19 14:15:29,585 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-19 14:15:29,585 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-19 14:15:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-19 14:15:29,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2024-11-19 14:15:29,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:29,586 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:29,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:29,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:29,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:29,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:15:29,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:29,870 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-19 14:15:29,871 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-19 14:15:29,871 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-19 14:15:29,927 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-19 14:15:29,928 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-19 14:15:29,928 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-19 14:15:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-19 14:15:29,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2024-11-19 14:15:29,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:29,929 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:29,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:29,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:29,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:30,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:15:30,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:30,227 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-19 14:15:30,227 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-19 14:15:30,227 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-19 14:15:30,268 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-19 14:15:30,269 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-19 14:15:30,269 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-19 14:15:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-19 14:15:30,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2024-11-19 14:15:30,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:30,270 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:30,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:30,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:30,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:30,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:15:30,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:30,594 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-19 14:15:30,594 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-19 14:15:30,595 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-19 14:15:30,666 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-19 14:15:30,667 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-19 14:15:30,667 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-19 14:15:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-11-19 14:15:30,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2024-11-19 14:15:30,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:30,668 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:30,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:30,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:30,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:30,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:15:30,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:30,954 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-19 14:15:30,955 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-19 14:15:30,955 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-19 14:15:31,434 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-19 14:15:31,435 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-19 14:15:31,435 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-19 14:15:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2024-11-19 14:15:31,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2024-11-19 14:15:31,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:31,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2024-11-19 14:15:31,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:31,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2024-11-19 14:15:31,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:31,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11129 states and 19734 transitions. [2024-11-19 14:15:31,566 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2024-11-19 14:15:31,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11129 states to 4882 states and 8741 transitions. [2024-11-19 14:15:31,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2024-11-19 14:15:31,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2024-11-19 14:15:31,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4882 states and 8741 transitions. [2024-11-19 14:15:31,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:31,601 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4882 states and 8741 transitions. [2024-11-19 14:15:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states and 8741 transitions. [2024-11-19 14:15:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3014. [2024-11-19 14:15:31,670 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-19 14:15:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 5467 transitions. [2024-11-19 14:15:31,681 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3014 states and 5467 transitions. [2024-11-19 14:15:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 14:15:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-19 14:15:31,684 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-19 14:15:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:31,748 INFO L93 Difference]: Finished difference Result 3401 states and 6312 transitions. [2024-11-19 14:15:31,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3401 states and 6312 transitions. [2024-11-19 14:15:31,779 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2024-11-19 14:15:31,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3401 states to 3369 states and 6221 transitions. [2024-11-19 14:15:31,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2024-11-19 14:15:31,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2024-11-19 14:15:31,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3369 states and 6221 transitions. [2024-11-19 14:15:31,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:31,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3369 states and 6221 transitions. [2024-11-19 14:15:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states and 6221 transitions. [2024-11-19 14:15:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3222. [2024-11-19 14:15:31,850 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-19 14:15:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 5927 transitions. [2024-11-19 14:15:31,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2024-11-19 14:15:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 14:15:31,857 INFO L425 stractBuchiCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2024-11-19 14:15:31,857 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-19 14:15:31,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3222 states and 5927 transitions. [2024-11-19 14:15:31,868 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2024-11-19 14:15:31,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:31,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:31,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2024-11-19 14:15:31,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2024-11-19 14:15:31,873 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-19 14:15:31,873 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-19 14:15:31,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:31,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 7 times [2024-11-19 14:15:31,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:31,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517180055] [2024-11-19 14:15:31,874 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:15:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:31,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:31,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:31,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 4 times [2024-11-19 14:15:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:31,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985206186] [2024-11-19 14:15:31,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:31,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:31,896 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:31,897 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:31,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:31,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:31,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 8 times [2024-11-19 14:15:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:31,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846946125] [2024-11-19 14:15:31,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:31,915 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:31,915 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:31,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:31,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:32,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:32,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:15:32 BoogieIcfgContainer [2024-11-19 14:15:32,643 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:15:32,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:15:32,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:15:32,644 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:15:32,644 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:15:20" (3/4) ... [2024-11-19 14:15:32,646 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:15:32,704 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:15:32,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:15:32,705 INFO L158 Benchmark]: Toolchain (without parser) took 13021.59ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 124.7MB in the beginning and 176.9MB in the end (delta: -52.2MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-11-19 14:15:32,705 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:15:32,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.36ms. Allocated memory is still 192.9MB. Free memory was 124.5MB in the beginning and 113.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:15:32,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.28ms. Allocated memory is still 192.9MB. Free memory was 113.4MB in the beginning and 111.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:15:32,706 INFO L158 Benchmark]: Boogie Preprocessor took 26.76ms. Allocated memory is still 192.9MB. Free memory was 111.9MB in the beginning and 110.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:15:32,706 INFO L158 Benchmark]: RCFGBuilder took 233.74ms. Allocated memory is still 192.9MB. Free memory was 110.5MB in the beginning and 101.2MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:15:32,706 INFO L158 Benchmark]: BuchiAutomizer took 12422.23ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 101.0MB in the beginning and 182.2MB in the end (delta: -81.2MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-19 14:15:32,707 INFO L158 Benchmark]: Witness Printer took 61.04ms. Allocated memory is still 281.0MB. Free memory was 182.2MB in the beginning and 176.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 14:15:32,708 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.49ms. Allocated memory is still 117.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.36ms. Allocated memory is still 192.9MB. Free memory was 124.5MB in the beginning and 113.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.28ms. Allocated memory is still 192.9MB. Free memory was 113.4MB in the beginning and 111.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.76ms. Allocated memory is still 192.9MB. Free memory was 111.9MB in the beginning and 110.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 233.74ms. Allocated memory is still 192.9MB. Free memory was 110.5MB in the beginning and 101.2MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 12422.23ms. Allocated memory was 192.9MB in the beginning and 281.0MB in the end (delta: 88.1MB). Free memory was 101.0MB in the beginning and 182.2MB in the end (delta: -81.2MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Witness Printer took 61.04ms. Allocated memory is still 281.0MB. Free memory was 182.2MB in the beginning and 176.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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.3s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 6.8s. 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.2s 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: 95ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s 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-19 14:15:32,741 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-19 14:15:32,937 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-19 14:15:33,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:33,337 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-19 14:15:33,537 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-19 14:15:33,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)