./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.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 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:21:28,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:21:28,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:21:28,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:21:28,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:21:28,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:21:28,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:21:28,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:21:28,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:21:28,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:21:28,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:21:28,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:21:28,476 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:21:28,478 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:21:28,478 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:21:28,478 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:21:28,479 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:21:28,479 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:21:28,479 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:21:28,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:21:28,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:21:28,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:21:28,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:21:28,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:21:28,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:21:28,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:21:28,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:21:28,482 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:21:28,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:21:28,482 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:21:28,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:21:28,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:21:28,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:21:28,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:21:28,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:21:28,484 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:21:28,485 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 -> 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 [2024-11-09 15:21:28,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:21:28,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:21:28,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:21:28,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:21:28,740 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:21:28,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2024-11-09 15:21:30,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:21:30,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:21:30,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2024-11-09 15:21:30,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c585df9c0/0b94e5f59f4a4c43910c34ce1ca942c3/FLAG2fed34468 [2024-11-09 15:21:30,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c585df9c0/0b94e5f59f4a4c43910c34ce1ca942c3 [2024-11-09 15:21:30,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:21:30,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:21:30,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:21:30,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:21:30,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:21:30,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d53498e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30, skipping insertion in model container [2024-11-09 15:21:30,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:21:30,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:21:30,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:21:30,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:21:30,560 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:21:30,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30 WrapperNode [2024-11-09 15:21:30,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:21:30,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:21:30,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:21:30,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:21:30,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,589 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-09 15:21:30,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:21:30,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:21:30,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:21:30,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:21:30,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,608 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 15:21:30,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:21:30,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:21:30,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:21:30,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:21:30,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (1/1) ... [2024-11-09 15:21:30,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:30,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:30,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:30,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:21:30,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:21:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:21:30,768 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:21:30,770 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:21:30,831 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-09 15:21:30,831 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:21:30,845 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:21:30,845 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:21:30,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:21:30 BoogieIcfgContainer [2024-11-09 15:21:30,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:21:30,847 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:21:30,847 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:21:30,851 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:21:30,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:21:30,852 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:21:30" (1/3) ... [2024-11-09 15:21:30,853 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b2c8a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:21:30, skipping insertion in model container [2024-11-09 15:21:30,853 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:21:30,853 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:30" (2/3) ... [2024-11-09 15:21:30,853 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b2c8a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:21:30, skipping insertion in model container [2024-11-09 15:21:30,854 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:21:30,854 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:21:30" (3/3) ... [2024-11-09 15:21:30,855 INFO L332 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2024-11-09 15:21:30,906 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:21:30,906 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:21:30,906 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:21:30,906 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:21:30,907 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:21:30,907 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:21:30,907 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:21:30,907 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:21:30,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:30,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:30,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:30,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:30,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:21:30,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:21:30,932 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:21:30,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:30,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:30,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:30,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:30,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:21:30,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:21:30,941 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4#L18-1true [2024-11-09 15:21:30,942 INFO L747 eck$LassoCheckResult]: Loop: 4#L18-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10#L12true assume !(main_~i~0#1 >= 10); 2#L12-2true assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 7#L15-1true assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4#L18-1true [2024-11-09 15:21:30,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:21:30,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:30,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073726705] [2024-11-09 15:21:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:30,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:31,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:31,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:31,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-11-09 15:21:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:31,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464480480] [2024-11-09 15:21:31,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:31,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:31,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:31,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:31,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2024-11-09 15:21:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831095760] [2024-11-09 15:21:31,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:31,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:31,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:31,255 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:31,256 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:31,256 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:31,256 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:31,256 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:31,256 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,256 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:31,256 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:31,257 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2024-11-09 15:21:31,257 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:31,257 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:31,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:31,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:31,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:31,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:31,365 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:31,365 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:31,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:31,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:31,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:21:31,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:31,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:31,397 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:31,397 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:31,408 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-09 15:21:31,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:31,410 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:31,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:21:31,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:31,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:31,433 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:31,434 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:31,449 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-09 15:21:31,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:31,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:31,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:21:31,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:31,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:31,505 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:31,505 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:31,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-09 15:21:31,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:31,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:31,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:21:31,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:31,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:31,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:21:31,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:31,559 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:31,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:21:31,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:31,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:31,576 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:31,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:31,587 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:31,587 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:31,587 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:31,587 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:31,588 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:31,588 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,588 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:31,588 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:31,588 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2024-11-09 15:21:31,588 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:31,588 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:31,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:31,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:31,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:31,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:31,661 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:31,665 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:31,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:31,669 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:31,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:21:31,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:31,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:31,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:31,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:31,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:31,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:31,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:31,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:31,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:31,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:31,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:31,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:21:31,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:31,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:31,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:31,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:31,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:31,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:31,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:31,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:31,741 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-09 15:21:31,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:31,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:31,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:21:31,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:31,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:31,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:31,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:31,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:31,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:31,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:31,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:31,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:31,771 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:31,771 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:31,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:31,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:31,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:31,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:21:31,777 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:31,777 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:31,777 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:31,778 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2024-11-09 15:21:31,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:21:31,797 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:31,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:31,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:31,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:31,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:31,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:31,920 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:31,922 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:31,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. 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 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 28 states and 45 transitions. Complement of second has 8 states. [2024-11-09 15:21:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-11-09 15:21:32,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-09 15:21:32,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:32,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-09 15:21:32,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:32,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-09 15:21:32,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:32,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 45 transitions. [2024-11-09 15:21:32,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-09 15:21:32,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 30 transitions. [2024-11-09 15:21:32,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-09 15:21:32,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-09 15:21:32,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2024-11-09 15:21:32,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:32,047 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 30 transitions. [2024-11-09 15:21:32,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:21:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2024-11-09 15:21:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-09 15:21:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2024-11-09 15:21:32,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-11-09 15:21:32,101 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-11-09 15:21:32,101 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:21:32,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2024-11-09 15:21:32,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-09 15:21:32,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:32,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:32,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:21:32,125 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:21:32,125 INFO L745 eck$LassoCheckResult]: Stem: 92#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 93#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; 97#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 89#L12 [2024-11-09 15:21:32,125 INFO L747 eck$LassoCheckResult]: Loop: 89#L12 assume !(main_~i~0#1 >= 10); 98#L12-2 assume !(main_~i~0#1 <= 0); 99#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 88#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 89#L12 [2024-11-09 15:21:32,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:32,126 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-11-09 15:21:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653037439] [2024-11-09 15:21:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:32,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:32,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:32,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:32,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2024-11-09 15:21:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359952195] [2024-11-09 15:21:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:32,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:32,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:32,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2024-11-09 15:21:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:32,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171153607] [2024-11-09 15:21:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:32,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:32,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:32,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171153607] [2024-11-09 15:21:32,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171153607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:21:32,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:21:32,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:21:32,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003572542] [2024-11-09 15:21:32,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:21:32,273 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:32,275 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:32,275 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:32,275 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:32,276 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:32,276 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,276 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:32,276 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:32,276 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2024-11-09 15:21:32,276 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:32,276 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:32,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,346 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:32,346 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:32,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:32,348 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:32,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:21:32,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:32,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:32,374 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:32,375 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:32,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:21:32,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:32,392 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:32,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:21:32,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:32,395 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:32,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:21:32,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:32,426 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:32,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:21:32,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:32,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:32,460 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:32,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:32,464 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:32,464 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:32,464 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:32,465 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:32,465 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:32,465 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,465 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:32,465 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:32,465 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2024-11-09 15:21:32,465 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:32,465 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:32,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,523 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:32,523 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:32,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:32,525 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:32,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:21:32,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:32,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:32,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:32,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:32,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:32,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:32,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:32,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:32,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:21:32,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:32,560 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:32,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:21:32,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:32,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:32,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:32,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:32,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:32,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:32,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:32,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:32,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:32,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:32,582 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:32,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:32,584 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:32,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:21:32,586 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:32,586 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:32,586 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:32,586 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2024-11-09 15:21:32,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:32,602 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:32,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:32,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:32,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:32,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:32,698 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 15:21:32,698 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:32,742 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. 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 44 states and 73 transitions. Complement of second has 7 states. [2024-11-09 15:21:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-09 15:21:32,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-09 15:21:32,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:32,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2024-11-09 15:21:32,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:32,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 8 letters. [2024-11-09 15:21:32,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:32,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 73 transitions. [2024-11-09 15:21:32,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-09 15:21:32,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 36 states and 59 transitions. [2024-11-09 15:21:32,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-09 15:21:32,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:21:32,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 59 transitions. [2024-11-09 15:21:32,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:32,750 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 59 transitions. [2024-11-09 15:21:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 59 transitions. [2024-11-09 15:21:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2024-11-09 15:21:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2024-11-09 15:21:32,756 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 46 transitions. [2024-11-09 15:21:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:32,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:21:32,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:21:32,762 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:32,778 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2024-11-09 15:21:32,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 56 transitions. [2024-11-09 15:21:32,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:21:32,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 49 transitions. [2024-11-09 15:21:32,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-09 15:21:32,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-09 15:21:32,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2024-11-09 15:21:32,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:32,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-11-09 15:21:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2024-11-09 15:21:32,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2024-11-09 15:21:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2024-11-09 15:21:32,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 40 transitions. [2024-11-09 15:21:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:21:32,790 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2024-11-09 15:21:32,790 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:21:32,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2024-11-09 15:21:32,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:21:32,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:32,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:32,792 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:21:32,792 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:21:32,792 INFO L745 eck$LassoCheckResult]: Stem: 264#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 265#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; 268#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 269#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 256#L12-2 assume !(main_~i~0#1 <= 0); 257#L15-1 [2024-11-09 15:21:32,792 INFO L747 eck$LassoCheckResult]: Loop: 257#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 266#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 275#L12 assume !(main_~i~0#1 >= 10); 273#L12-2 assume !(main_~i~0#1 <= 0); 257#L15-1 [2024-11-09 15:21:32,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2024-11-09 15:21:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:32,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542227133] [2024-11-09 15:21:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:32,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:32,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:32,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:32,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:32,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2024-11-09 15:21:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:32,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135598218] [2024-11-09 15:21:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:32,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:32,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:32,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2024-11-09 15:21:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:32,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861931598] [2024-11-09 15:21:32,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:32,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:32,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:32,889 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:32,889 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:32,889 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:32,890 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:32,890 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:32,890 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,890 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:32,890 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:32,890 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2024-11-09 15:21:32,890 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:32,890 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:32,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:32,951 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:32,951 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:32,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:32,953 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:32,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:21:32,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:32,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:32,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:21:32,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:32,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:32,987 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:32,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:21:32,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:32,991 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:33,066 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:33,071 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-09 15:21:33,071 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:33,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:33,072 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:33,072 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:33,072 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:33,072 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:33,072 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:33,072 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:33,072 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2024-11-09 15:21:33,072 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:33,072 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:33,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,122 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:33,122 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:33,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:33,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:33,124 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:33,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:21:33,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:33,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:33,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:33,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:33,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:33,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:33,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:33,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:33,143 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:33,146 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-09 15:21:33,146 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:33,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:33,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:33,149 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:33,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:21:33,152 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:33,152 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:33,152 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:33,152 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-09 15:21:33,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:21:33,168 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:33,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:33,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:33,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:33,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:33,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:33,225 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:33,225 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:33,251 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 58 states and 90 transitions. Complement of second has 7 states. [2024-11-09 15:21:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-09 15:21:33,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-09 15:21:33,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:33,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-09 15:21:33,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:33,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2024-11-09 15:21:33,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:33,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 90 transitions. [2024-11-09 15:21:33,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-09 15:21:33,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 85 transitions. [2024-11-09 15:21:33,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-09 15:21:33,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-09 15:21:33,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2024-11-09 15:21:33,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:33,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-11-09 15:21:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2024-11-09 15:21:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-11-09 15:21:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2024-11-09 15:21:33,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 79 transitions. [2024-11-09 15:21:33,260 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 79 transitions. [2024-11-09 15:21:33,261 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:21:33,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 79 transitions. [2024-11-09 15:21:33,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-09 15:21:33,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:33,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:33,262 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:21:33,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:21:33,263 INFO L745 eck$LassoCheckResult]: Stem: 398#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 399#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; 404#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 416#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 409#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 410#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 413#L18-1 [2024-11-09 15:21:33,263 INFO L747 eck$LassoCheckResult]: Loop: 413#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 411#L12 assume !(main_~i~0#1 >= 10); 412#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 422#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 413#L18-1 [2024-11-09 15:21:33,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:33,263 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2024-11-09 15:21:33,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:33,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240069745] [2024-11-09 15:21:33,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:33,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:33,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:33,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240069745] [2024-11-09 15:21:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240069745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:21:33,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:21:33,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:21:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899691917] [2024-11-09 15:21:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:21:33,288 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:33,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2024-11-09 15:21:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:33,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096207810] [2024-11-09 15:21:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:33,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:33,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:33,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096207810] [2024-11-09 15:21:33,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096207810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:21:33,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:21:33,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:21:33,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980809506] [2024-11-09 15:21:33,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:21:33,315 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:21:33,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:33,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:21:33,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:21:33,316 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. cyclomatic complexity: 36 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:33,327 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2024-11-09 15:21:33,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 69 transitions. [2024-11-09 15:21:33,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:21:33,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 60 transitions. [2024-11-09 15:21:33,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-09 15:21:33,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-09 15:21:33,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 60 transitions. [2024-11-09 15:21:33,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:33,329 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-11-09 15:21:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 60 transitions. [2024-11-09 15:21:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-09 15:21:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:33,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-11-09 15:21:33,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-11-09 15:21:33,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:21:33,337 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-11-09 15:21:33,337 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:21:33,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2024-11-09 15:21:33,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:21:33,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:33,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:33,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:21:33,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:21:33,339 INFO L745 eck$LassoCheckResult]: Stem: 501#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 502#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; 506#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 513#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 511#L12-2 assume !(main_~i~0#1 <= 0); 503#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 504#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 523#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 493#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 494#L15-1 [2024-11-09 15:21:33,339 INFO L747 eck$LassoCheckResult]: Loop: 494#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 509#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 522#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 520#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 494#L15-1 [2024-11-09 15:21:33,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash 588716517, now seen corresponding path program 1 times [2024-11-09 15:21:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:33,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82435571] [2024-11-09 15:21:33,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:33,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:33,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:33,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82435571] [2024-11-09 15:21:33,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82435571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:21:33,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:21:33,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:21:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372848386] [2024-11-09 15:21:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:21:33,391 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:33,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1709112, now seen corresponding path program 1 times [2024-11-09 15:21:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:33,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941690445] [2024-11-09 15:21:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:33,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:33,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941690445] [2024-11-09 15:21:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941690445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:21:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:21:33,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:21:33,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167364386] [2024-11-09 15:21:33,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:21:33,423 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:21:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:33,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:21:33,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:21:33,424 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 24 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:33,437 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-11-09 15:21:33,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2024-11-09 15:21:33,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-09 15:21:33,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 60 transitions. [2024-11-09 15:21:33,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-09 15:21:33,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-09 15:21:33,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2024-11-09 15:21:33,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:33,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 60 transitions. [2024-11-09 15:21:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2024-11-09 15:21:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-11-09 15:21:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2024-11-09 15:21:33,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 54 transitions. [2024-11-09 15:21:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:21:33,445 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2024-11-09 15:21:33,445 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:21:33,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2024-11-09 15:21:33,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-09 15:21:33,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:33,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:33,448 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:21:33,448 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:21:33,448 INFO L745 eck$LassoCheckResult]: Stem: 598#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 599#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; 593#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 594#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 589#L12-2 assume !(main_~i~0#1 <= 0); 590#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 600#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 613#L12 assume !(main_~i~0#1 >= 10); 608#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 604#L15-1 [2024-11-09 15:21:33,448 INFO L747 eck$LassoCheckResult]: Loop: 604#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 605#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 610#L12 assume !(main_~i~0#1 >= 10); 609#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 604#L15-1 [2024-11-09 15:21:33,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash 588716579, now seen corresponding path program 1 times [2024-11-09 15:21:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323823073] [2024-11-09 15:21:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:33,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323823073] [2024-11-09 15:21:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323823073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:33,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962964133] [2024-11-09 15:21:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:33,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:33,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:33,486 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:33,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 15:21:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:33,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:21:33,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:33,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:33,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962964133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:33,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:33,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-09 15:21:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379850704] [2024-11-09 15:21:33,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:33,567 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1709174, now seen corresponding path program 2 times [2024-11-09 15:21:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:33,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911692834] [2024-11-09 15:21:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:33,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:33,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:33,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:33,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:21:33,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:21:33,674 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:33,674 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:33,674 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:33,675 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:33,675 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:33,675 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:33,675 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:33,675 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:33,675 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2024-11-09 15:21:33,675 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:33,675 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:33,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,739 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:33,739 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:33,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:33,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:33,741 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:33,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:21:33,744 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:33,744 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:33,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:33,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:33,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:33,770 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:33,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:21:33,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:33,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:33,797 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:33,801 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-09 15:21:33,801 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:33,802 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:33,802 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:33,802 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:33,802 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:33,802 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:33,802 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:33,802 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:33,802 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2024-11-09 15:21:33,802 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:33,802 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:33,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:33,860 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:33,860 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:33,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:33,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:33,862 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:33,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:21:33,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:33,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:33,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:33,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:33,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:33,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:33,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:33,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:33,881 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:33,884 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:33,884 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:21:33,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:33,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:33,886 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:33,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:21:33,887 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:33,887 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:33,887 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:33,887 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-09 15:21:33,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-09 15:21:33,898 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:33,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:33,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:33,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:33,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:33,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:33,950 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:33,950 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 54 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:33,990 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 54 transitions. cyclomatic complexity: 20. 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 101 states and 136 transitions. Complement of second has 7 states. [2024-11-09 15:21:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-09 15:21:33,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-09 15:21:33,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:33,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 4 letters. [2024-11-09 15:21:33,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:33,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 8 letters. [2024-11-09 15:21:33,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:33,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 136 transitions. [2024-11-09 15:21:33,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-09 15:21:33,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 91 states and 122 transitions. [2024-11-09 15:21:33,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-09 15:21:33,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 15:21:33,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 122 transitions. [2024-11-09 15:21:33,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:33,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2024-11-09 15:21:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 122 transitions. [2024-11-09 15:21:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2024-11-09 15:21:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-11-09 15:21:34,004 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-11-09 15:21:34,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:34,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:21:34,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:21:34,004 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:34,047 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2024-11-09 15:21:34,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 174 transitions. [2024-11-09 15:21:34,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2024-11-09 15:21:34,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 108 states and 137 transitions. [2024-11-09 15:21:34,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-09 15:21:34,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-09 15:21:34,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 137 transitions. [2024-11-09 15:21:34,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:34,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 137 transitions. [2024-11-09 15:21:34,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 137 transitions. [2024-11-09 15:21:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2024-11-09 15:21:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 85 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2024-11-09 15:21:34,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 111 transitions. [2024-11-09 15:21:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:21:34,059 INFO L425 stractBuchiCegarLoop]: Abstraction has 86 states and 111 transitions. [2024-11-09 15:21:34,060 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:21:34,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 111 transitions. [2024-11-09 15:21:34,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-09 15:21:34,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:34,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:34,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:21:34,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:21:34,061 INFO L745 eck$LassoCheckResult]: Stem: 1067#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1068#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; 1071#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1081#L12 assume !(main_~i~0#1 >= 10); 1090#L12-2 assume !(main_~i~0#1 <= 0); 1089#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1087#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1084#L12 assume !(main_~i~0#1 >= 10); 1083#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1082#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1062#L18-1 [2024-11-09 15:21:34,061 INFO L747 eck$LassoCheckResult]: Loop: 1062#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1063#L12 assume !(main_~i~0#1 >= 10); 1111#L12-2 assume !(main_~i~0#1 <= 0); 1073#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1062#L18-1 [2024-11-09 15:21:34,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1449615143, now seen corresponding path program 1 times [2024-11-09 15:21:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311868196] [2024-11-09 15:21:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:34,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:34,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:34,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:34,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 2 times [2024-11-09 15:21:34,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:34,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531124839] [2024-11-09 15:21:34,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:34,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:34,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:34,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:34,095 INFO L85 PathProgramCache]: Analyzing trace with hash -130036926, now seen corresponding path program 2 times [2024-11-09 15:21:34,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:34,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914421832] [2024-11-09 15:21:34,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:34,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:34,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:34,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:34,141 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:34,142 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:34,142 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:34,142 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:34,142 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:34,142 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,142 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:34,142 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:34,142 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2024-11-09 15:21:34,142 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:34,142 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:34,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,188 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:34,188 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:34,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,190 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:21:34,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:34,195 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:34,225 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-09 15:21:34,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,228 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:21:34,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:34,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:34,249 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:34,264 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-09 15:21:34,264 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:34,264 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:34,264 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:34,265 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:34,265 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:34,265 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,265 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:34,265 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:34,265 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2024-11-09 15:21:34,265 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:34,265 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:34,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,312 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:34,312 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:34,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,314 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:21:34,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:34,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:34,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:34,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:34,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:34,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:34,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:34,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:34,331 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:34,333 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:34,333 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,335 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:21:34,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:34,337 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:34,337 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:34,337 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2024-11-09 15:21:34,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-09 15:21:34,352 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:34,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:34,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:34,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:34,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:34,412 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:34,412 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 111 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:34,442 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 111 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 115 states and 145 transitions. Complement of second has 7 states. [2024-11-09 15:21:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-09 15:21:34,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-09 15:21:34,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:34,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-09 15:21:34,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:34,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2024-11-09 15:21:34,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:34,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 145 transitions. [2024-11-09 15:21:34,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-09 15:21:34,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 97 states and 125 transitions. [2024-11-09 15:21:34,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 15:21:34,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-09 15:21:34,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 125 transitions. [2024-11-09 15:21:34,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:34,450 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 125 transitions. [2024-11-09 15:21:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 125 transitions. [2024-11-09 15:21:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2024-11-09 15:21:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 85 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2024-11-09 15:21:34,457 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 112 transitions. [2024-11-09 15:21:34,457 INFO L425 stractBuchiCegarLoop]: Abstraction has 86 states and 112 transitions. [2024-11-09 15:21:34,457 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:21:34,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 112 transitions. [2024-11-09 15:21:34,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-09 15:21:34,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:34,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:34,459 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:21:34,459 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:21:34,459 INFO L745 eck$LassoCheckResult]: Stem: 1333#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1334#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; 1338#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1332#L12 assume !(main_~i~0#1 >= 10); 1343#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1344#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1407#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1329#L12 assume !(main_~i~0#1 >= 10); 1326#L12-2 assume !(main_~i~0#1 <= 0); 1327#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1337#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1330#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1324#L12-2 [2024-11-09 15:21:34,459 INFO L747 eck$LassoCheckResult]: Loop: 1324#L12-2 assume !(main_~i~0#1 <= 0); 1325#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1342#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1385#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1324#L12-2 [2024-11-09 15:21:34,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:34,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1818617978, now seen corresponding path program 1 times [2024-11-09 15:21:34,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:34,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944486185] [2024-11-09 15:21:34,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:34,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:34,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:34,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944486185] [2024-11-09 15:21:34,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944486185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:34,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563116334] [2024-11-09 15:21:34,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:34,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:34,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,515 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-09 15:21:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:34,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:34,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:34,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:34,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563116334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:34,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:34,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 15:21:34,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513158396] [2024-11-09 15:21:34,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:34,593 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:34,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2024-11-09 15:21:34,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:34,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316443805] [2024-11-09 15:21:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:34,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:34,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:34,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:34,632 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:34,633 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:34,633 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:34,633 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:34,633 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:34,633 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,633 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:34,633 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:34,633 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2024-11-09 15:21:34,633 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:34,633 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:34,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,687 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:34,687 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:34,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,690 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:21:34,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:34,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:34,709 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:34,710 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:34,723 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-09 15:21:34,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,724 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:21:34,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:34,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:34,750 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:34,750 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:34,764 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-09 15:21:34,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,765 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 15:21:34,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:34,767 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:34,784 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:34,785 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:34,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:34,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,796 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:21:34,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:34,798 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:34,819 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-09 15:21:34,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,821 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:21:34,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:34,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:34,837 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:34,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:34,848 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:34,848 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:34,848 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:34,848 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:34,848 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:34,848 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,848 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:34,848 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:34,848 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2024-11-09 15:21:34,848 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:34,848 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:34,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:34,901 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:34,901 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:34,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,905 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-09 15:21:34,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:34,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:34,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:34,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:34,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:34,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:34,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:34,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:34,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:34,944 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-09 15:21:34,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,945 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-09 15:21:34,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:34,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:34,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:34,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:34,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:34,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:34,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:34,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:34,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:34,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-09 15:21:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:34,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:34,990 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:34,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-09 15:21:34,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:34,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-09 15:21:35,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:35,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:35,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:35,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:35,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:35,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:35,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:35,028 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-09 15:21:35,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:35,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:35,031 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:35,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-09 15:21:35,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:35,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:35,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:35,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:35,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:35,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:35,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:35,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:35,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:35,054 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:35,054 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:21:35,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:35,056 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:35,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-09 15:21:35,058 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:35,058 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:35,059 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:35,059 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-09 15:21:35,073 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-09 15:21:35,073 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:35,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:35,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:35,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:35,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:35,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:35,125 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:35,125 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 112 transitions. cyclomatic complexity: 32 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:35,150 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 112 transitions. cyclomatic complexity: 32. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 188 states and 256 transitions. Complement of second has 7 states. [2024-11-09 15:21:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-09 15:21:35,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-09 15:21:35,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:35,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2024-11-09 15:21:35,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:35,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2024-11-09 15:21:35,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:35,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 256 transitions. [2024-11-09 15:21:35,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-09 15:21:35,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 140 states and 182 transitions. [2024-11-09 15:21:35,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-09 15:21:35,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2024-11-09 15:21:35,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 182 transitions. [2024-11-09 15:21:35,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:35,156 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140 states and 182 transitions. [2024-11-09 15:21:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 182 transitions. [2024-11-09 15:21:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 94. [2024-11-09 15:21:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2024-11-09 15:21:35,161 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 124 transitions. [2024-11-09 15:21:35,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:35,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 15:21:35,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:21:35,161 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:35,202 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2024-11-09 15:21:35,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 178 transitions. [2024-11-09 15:21:35,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2024-11-09 15:21:35,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 150 states and 168 transitions. [2024-11-09 15:21:35,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-09 15:21:35,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-09 15:21:35,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 168 transitions. [2024-11-09 15:21:35,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:35,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 168 transitions. [2024-11-09 15:21:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 168 transitions. [2024-11-09 15:21:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2024-11-09 15:21:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.1205673758865249) internal successors, (158), 140 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2024-11-09 15:21:35,218 INFO L240 hiAutomatonCegarLoop]: Abstraction has 141 states and 158 transitions. [2024-11-09 15:21:35,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:21:35,224 INFO L425 stractBuchiCegarLoop]: Abstraction has 141 states and 158 transitions. [2024-11-09 15:21:35,224 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:21:35,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 158 transitions. [2024-11-09 15:21:35,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2024-11-09 15:21:35,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:35,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:35,226 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 9, 6, 4, 2, 1, 1, 1] [2024-11-09 15:21:35,226 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:21:35,226 INFO L745 eck$LassoCheckResult]: Stem: 2001#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2002#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; 2005#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2016#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 2017#L12-2 assume !(main_~i~0#1 <= 0); 2038#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 2037#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2035#L12 assume !(main_~i~0#1 >= 10); 2034#L12-2 assume !(main_~i~0#1 <= 0); 2033#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 2032#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2031#L12 assume !(main_~i~0#1 >= 10); 2030#L12-2 assume !(main_~i~0#1 <= 0); 2029#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 2028#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2027#L12 assume !(main_~i~0#1 >= 10); 2024#L12-2 assume !(main_~i~0#1 <= 0); 2026#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 2025#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2022#L12 assume !(main_~i~0#1 >= 10); 2023#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 2090#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 2088#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2087#L12 assume !(main_~i~0#1 >= 10); 2086#L12-2 assume !(main_~i~0#1 <= 0); 2085#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 2084#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2083#L12 assume !(main_~i~0#1 >= 10); 2082#L12-2 assume !(main_~i~0#1 <= 0); 2081#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 2080#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2079#L12 assume !(main_~i~0#1 >= 10); 2078#L12-2 assume !(main_~i~0#1 <= 0); 2077#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 2076#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2075#L12 assume !(main_~i~0#1 >= 10); 2074#L12-2 assume !(main_~i~0#1 <= 0); 2073#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 2072#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2050#L12 assume !(main_~i~0#1 >= 10); 2054#L12-2 assume !(main_~i~0#1 <= 0); 2052#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 2049#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2044#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 2043#L12-2 [2024-11-09 15:21:35,227 INFO L747 eck$LassoCheckResult]: Loop: 2043#L12-2 assume !(main_~i~0#1 <= 0); 2046#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 2045#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2042#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 2043#L12-2 [2024-11-09 15:21:35,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:35,227 INFO L85 PathProgramCache]: Analyzing trace with hash 178061768, now seen corresponding path program 1 times [2024-11-09 15:21:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814139712] [2024-11-09 15:21:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:35,340 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 117 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 15:21:35,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:35,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814139712] [2024-11-09 15:21:35,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814139712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:35,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087288136] [2024-11-09 15:21:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:35,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:35,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:35,342 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:35,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-09 15:21:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:35,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:21:35,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 117 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 15:21:35,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 117 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 15:21:35,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087288136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:35,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:35,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 15:21:35,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487102172] [2024-11-09 15:21:35,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:35,496 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:35,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2024-11-09 15:21:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726377262] [2024-11-09 15:21:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:35,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:35,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:35,541 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:35,541 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:35,541 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:35,541 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:35,541 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:35,541 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:35,541 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:35,542 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:35,542 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2024-11-09 15:21:35,542 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:35,542 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:35,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:35,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:35,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:35,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:35,598 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:35,598 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:35,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:35,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:35,600 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:35,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-09 15:21:35,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:35,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:35,631 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-09 15:21:35,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:35,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:35,634 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:35,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-09 15:21:35,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:35,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:35,653 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:35,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-09 15:21:35,668 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:35,668 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:35,668 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:35,668 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:35,668 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:35,668 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:35,669 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:35,669 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:35,669 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2024-11-09 15:21:35,669 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:35,669 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:35,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:35,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:35,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:35,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:35,732 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:35,732 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:35,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:35,735 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:35,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-09 15:21:35,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:35,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:35,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:35,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:35,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:35,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:35,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:35,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:35,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:35,761 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:35,762 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:21:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:35,763 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:35,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-09 15:21:35,765 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:35,765 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:35,765 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:35,765 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-09 15:21:35,776 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-09 15:21:35,776 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:35,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:35,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:35,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:35,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:35,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:35,854 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:35,854 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 141 states and 158 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:35,879 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 141 states and 158 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 172 states and 193 transitions. Complement of second has 7 states. [2024-11-09 15:21:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-09 15:21:35,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 44 letters. Loop has 4 letters. [2024-11-09 15:21:35,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:35,881 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:35,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:35,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:35,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:35,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:35,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:35,972 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:35,973 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 141 states and 158 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:36,008 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 141 states and 158 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 202 states and 225 transitions. Complement of second has 7 states. [2024-11-09 15:21:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-09 15:21:36,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 44 letters. Loop has 4 letters. [2024-11-09 15:21:36,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:36,010 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:36,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:36,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:36,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:36,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:36,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:36,106 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:36,106 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 141 states and 158 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:36,133 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 141 states and 158 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 187 states and 211 transitions. Complement of second has 8 states. [2024-11-09 15:21:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-09 15:21:36,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 44 letters. Loop has 4 letters. [2024-11-09 15:21:36,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:36,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 48 letters. Loop has 4 letters. [2024-11-09 15:21:36,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:36,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 44 letters. Loop has 8 letters. [2024-11-09 15:21:36,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:36,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 211 transitions. [2024-11-09 15:21:36,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2024-11-09 15:21:36,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 144 states and 161 transitions. [2024-11-09 15:21:36,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-09 15:21:36,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-11-09 15:21:36,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 161 transitions. [2024-11-09 15:21:36,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:36,141 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 161 transitions. [2024-11-09 15:21:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 161 transitions. [2024-11-09 15:21:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2024-11-09 15:21:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 91 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2024-11-09 15:21:36,148 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 103 transitions. [2024-11-09 15:21:36,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:36,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 15:21:36,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-09 15:21:36,149 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:36,263 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2024-11-09 15:21:36,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 208 transitions. [2024-11-09 15:21:36,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2024-11-09 15:21:36,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 178 states and 195 transitions. [2024-11-09 15:21:36,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-09 15:21:36,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2024-11-09 15:21:36,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 195 transitions. [2024-11-09 15:21:36,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:36,267 INFO L218 hiAutomatonCegarLoop]: Abstraction has 178 states and 195 transitions. [2024-11-09 15:21:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 195 transitions. [2024-11-09 15:21:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2024-11-09 15:21:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2024-11-09 15:21:36,271 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 185 transitions. [2024-11-09 15:21:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 15:21:36,271 INFO L425 stractBuchiCegarLoop]: Abstraction has 168 states and 185 transitions. [2024-11-09 15:21:36,272 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:21:36,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 185 transitions. [2024-11-09 15:21:36,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-09 15:21:36,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:36,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:36,274 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2024-11-09 15:21:36,274 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2024-11-09 15:21:36,274 INFO L745 eck$LassoCheckResult]: Stem: 3724#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3725#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; 3729#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3733#L12 assume !(main_~i~0#1 >= 10); 3739#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 3736#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3738#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3845#L12 assume !(main_~i~0#1 >= 10); 3791#L12-2 assume !(main_~i~0#1 <= 0); 3792#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3869#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3868#L12 assume !(main_~i~0#1 >= 10); 3843#L12-2 assume !(main_~i~0#1 <= 0); 3844#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3866#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3864#L12 assume !(main_~i~0#1 >= 10); 3862#L12-2 assume !(main_~i~0#1 <= 0); 3837#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3836#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3834#L12 assume !(main_~i~0#1 >= 10); 3835#L12-2 assume !(main_~i~0#1 <= 0); 3831#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3720#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3721#L12 assume !(main_~i~0#1 >= 10); 3849#L12-2 assume !(main_~i~0#1 <= 0); 3848#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3846#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3784#L12 [2024-11-09 15:21:36,274 INFO L747 eck$LassoCheckResult]: Loop: 3784#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 3783#L12-2 assume !(main_~i~0#1 <= 0); 3728#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3722#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3723#L12 assume !(main_~i~0#1 >= 10); 3718#L12-2 assume !(main_~i~0#1 <= 0); 3719#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3828#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3827#L12 assume !(main_~i~0#1 >= 10); 3826#L12-2 assume !(main_~i~0#1 <= 0); 3825#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3824#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3823#L12 assume !(main_~i~0#1 >= 10); 3822#L12-2 assume !(main_~i~0#1 <= 0); 3821#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3820#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3819#L12 assume !(main_~i~0#1 >= 10); 3818#L12-2 assume !(main_~i~0#1 <= 0); 3817#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3816#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3815#L12 assume !(main_~i~0#1 >= 10); 3814#L12-2 assume !(main_~i~0#1 <= 0); 3813#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3812#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3811#L12 assume !(main_~i~0#1 >= 10); 3810#L12-2 assume !(main_~i~0#1 <= 0); 3809#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3808#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3807#L12 assume !(main_~i~0#1 >= 10); 3806#L12-2 assume !(main_~i~0#1 <= 0); 3805#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3804#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3803#L12 assume !(main_~i~0#1 >= 10); 3802#L12-2 assume !(main_~i~0#1 <= 0); 3801#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3800#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3799#L12 assume !(main_~i~0#1 >= 10); 3794#L12-2 assume !(main_~i~0#1 <= 0); 3798#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3796#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3793#L12 assume !(main_~i~0#1 >= 10); 3788#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 3789#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3797#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3795#L12 assume !(main_~i~0#1 >= 10); 3790#L12-2 assume !(main_~i~0#1 <= 0); 3786#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3787#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3829#L12 assume !(main_~i~0#1 >= 10); 3830#L12-2 assume !(main_~i~0#1 <= 0); 3842#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3841#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3840#L12 assume !(main_~i~0#1 >= 10); 3838#L12-2 assume !(main_~i~0#1 <= 0); 3839#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3858#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3856#L12 assume !(main_~i~0#1 >= 10); 3832#L12-2 assume !(main_~i~0#1 <= 0); 3833#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3852#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3730#L12 assume !(main_~i~0#1 >= 10); 3731#L12-2 assume !(main_~i~0#1 <= 0); 3883#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3882#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3870#L12 assume !(main_~i~0#1 >= 10); 3716#L12-2 assume !(main_~i~0#1 <= 0); 3717#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3735#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3871#L12 assume !(main_~i~0#1 >= 10); 3881#L12-2 assume !(main_~i~0#1 <= 0); 3880#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3879#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3878#L12 assume !(main_~i~0#1 >= 10); 3877#L12-2 assume !(main_~i~0#1 <= 0); 3876#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3875#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3874#L12 assume !(main_~i~0#1 >= 10); 3873#L12-2 assume !(main_~i~0#1 <= 0); 3872#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3785#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3784#L12 [2024-11-09 15:21:36,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:36,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1514411024, now seen corresponding path program 1 times [2024-11-09 15:21:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:36,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931233427] [2024-11-09 15:21:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:36,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:36,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:36,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:36,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1617023097, now seen corresponding path program 1 times [2024-11-09 15:21:36,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:36,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069151444] [2024-11-09 15:21:36,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:36,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:36,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:36,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash -883489176, now seen corresponding path program 2 times [2024-11-09 15:21:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:36,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039746796] [2024-11-09 15:21:36,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:36,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-09 15:21:36,471 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-09 15:21:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2024-11-09 15:21:36,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:36,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039746796] [2024-11-09 15:21:36,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039746796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:36,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238498778] [2024-11-09 15:21:36,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:21:36,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:36,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:36,532 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:36,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-11-09 15:21:36,580 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:21:36,580 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:36,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:21:36,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2024-11-09 15:21:36,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2024-11-09 15:21:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238498778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:36,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-09 15:21:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085401878] [2024-11-09 15:21:36,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:37,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:37,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 15:21:37,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-09 15:21:37,144 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. cyclomatic complexity: 21 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:37,236 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2024-11-09 15:21:37,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 229 transitions. [2024-11-09 15:21:37,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-09 15:21:37,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 208 states and 223 transitions. [2024-11-09 15:21:37,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2024-11-09 15:21:37,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2024-11-09 15:21:37,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 223 transitions. [2024-11-09 15:21:37,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:37,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 208 states and 223 transitions. [2024-11-09 15:21:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 223 transitions. [2024-11-09 15:21:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 167. [2024-11-09 15:21:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.089820359281437) internal successors, (182), 166 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2024-11-09 15:21:37,242 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 182 transitions. [2024-11-09 15:21:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 15:21:37,243 INFO L425 stractBuchiCegarLoop]: Abstraction has 167 states and 182 transitions. [2024-11-09 15:21:37,243 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:21:37,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 182 transitions. [2024-11-09 15:21:37,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-09 15:21:37,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:37,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:37,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:21:37,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2024-11-09 15:21:37,245 INFO L745 eck$LassoCheckResult]: Stem: 4759#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4760#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; 4761#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4774#L12 assume !(main_~i~0#1 >= 10); 4771#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 4767#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4769#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4812#L12 assume !(main_~i~0#1 >= 10); 4811#L12-2 assume !(main_~i~0#1 <= 0); 4810#L15-1 [2024-11-09 15:21:37,245 INFO L747 eck$LassoCheckResult]: Loop: 4810#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4809#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4808#L12 assume !(main_~i~0#1 >= 10); 4807#L12-2 assume !(main_~i~0#1 <= 0); 4806#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4805#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4804#L12 assume !(main_~i~0#1 >= 10); 4803#L12-2 assume !(main_~i~0#1 <= 0); 4802#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4801#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4800#L12 assume !(main_~i~0#1 >= 10); 4799#L12-2 assume !(main_~i~0#1 <= 0); 4798#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4797#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4796#L12 assume !(main_~i~0#1 >= 10); 4795#L12-2 assume !(main_~i~0#1 <= 0); 4794#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4793#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4792#L12 assume !(main_~i~0#1 >= 10); 4791#L12-2 assume !(main_~i~0#1 <= 0); 4790#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4789#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4788#L12 assume !(main_~i~0#1 >= 10); 4787#L12-2 assume !(main_~i~0#1 <= 0); 4786#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4785#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4784#L12 assume !(main_~i~0#1 >= 10); 4783#L12-2 assume !(main_~i~0#1 <= 0); 4782#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4781#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4780#L12 assume !(main_~i~0#1 >= 10); 4779#L12-2 assume !(main_~i~0#1 <= 0); 4778#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4777#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4776#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 4773#L12-2 assume !(main_~i~0#1 <= 0); 4754#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4757#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4758#L12 assume !(main_~i~0#1 >= 10); 4853#L12-2 assume !(main_~i~0#1 <= 0); 4852#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4851#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4850#L12 assume !(main_~i~0#1 >= 10); 4849#L12-2 assume !(main_~i~0#1 <= 0); 4848#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4847#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4846#L12 assume !(main_~i~0#1 >= 10); 4845#L12-2 assume !(main_~i~0#1 <= 0); 4844#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4843#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4842#L12 assume !(main_~i~0#1 >= 10); 4841#L12-2 assume !(main_~i~0#1 <= 0); 4840#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4839#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4838#L12 assume !(main_~i~0#1 >= 10); 4837#L12-2 assume !(main_~i~0#1 <= 0); 4836#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4835#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4834#L12 assume !(main_~i~0#1 >= 10); 4833#L12-2 assume !(main_~i~0#1 <= 0); 4832#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4831#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4830#L12 assume !(main_~i~0#1 >= 10); 4829#L12-2 assume !(main_~i~0#1 <= 0); 4828#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4827#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4826#L12 assume !(main_~i~0#1 >= 10); 4825#L12-2 assume !(main_~i~0#1 <= 0); 4824#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4823#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4822#L12 assume !(main_~i~0#1 >= 10); 4821#L12-2 assume !(main_~i~0#1 <= 0); 4820#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4819#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4818#L12 assume !(main_~i~0#1 >= 10); 4816#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 4815#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4813#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4814#L12 assume !(main_~i~0#1 >= 10); 4817#L12-2 assume !(main_~i~0#1 <= 0); 4810#L15-1 [2024-11-09 15:21:37,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:37,246 INFO L85 PathProgramCache]: Analyzing trace with hash 644068259, now seen corresponding path program 2 times [2024-11-09 15:21:37,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:37,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16923192] [2024-11-09 15:21:37,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:37,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:37,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:37,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:37,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1888138361, now seen corresponding path program 2 times [2024-11-09 15:21:37,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:37,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602179095] [2024-11-09 15:21:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:37,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:37,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:37,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1126640613, now seen corresponding path program 3 times [2024-11-09 15:21:37,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:37,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164631374] [2024-11-09 15:21:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:37,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:37,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:37,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:37,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:37,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:21:37 BoogieIcfgContainer [2024-11-09 15:21:37,846 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:21:37,847 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:21:37,847 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:21:37,847 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:21:37,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:21:30" (3/4) ... [2024-11-09 15:21:37,851 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:21:37,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:21:37,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:21:37,914 INFO L158 Benchmark]: Toolchain (without parser) took 7634.58ms. Allocated memory was 121.6MB in the beginning and 218.1MB in the end (delta: 96.5MB). Free memory was 52.8MB in the beginning and 123.8MB in the end (delta: -71.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-11-09 15:21:37,915 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 121.6MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:21:37,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.42ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 52.5MB in the beginning and 131.4MB in the end (delta: -78.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 15:21:37,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.52ms. Allocated memory is still 159.4MB. Free memory was 131.4MB in the beginning and 129.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:21:37,916 INFO L158 Benchmark]: Boogie Preprocessor took 32.74ms. Allocated memory is still 159.4MB. Free memory was 129.3MB in the beginning and 128.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:21:37,916 INFO L158 Benchmark]: RCFGBuilder took 222.67ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 118.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 15:21:37,916 INFO L158 Benchmark]: BuchiAutomizer took 6998.99ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 118.8MB in the beginning and 128.0MB in the end (delta: -9.2MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2024-11-09 15:21:37,916 INFO L158 Benchmark]: Witness Printer took 67.53ms. Allocated memory is still 218.1MB. Free memory was 128.0MB in the beginning and 123.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:21:37,918 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.45ms. Allocated memory is still 121.6MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.42ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 52.5MB in the beginning and 131.4MB in the end (delta: -78.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.52ms. Allocated memory is still 159.4MB. Free memory was 131.4MB in the beginning and 129.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.74ms. Allocated memory is still 159.4MB. Free memory was 129.3MB in the beginning and 128.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 222.67ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 118.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6998.99ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 118.8MB in the beginning and 128.0MB in the end (delta: -9.2MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Witness Printer took 67.53ms. Allocated memory is still 218.1MB. Free memory was 128.0MB in the beginning and 123.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (7 trivial, 6 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 5 locations. One deterministic module has affine ranking function (((long) -2 * i) + 19) 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) -1 * i) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 167 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 11 iterations. TraceHistogramMax:20. Analysis of lassos took 5.2s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 232 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 577 IncrementalHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 124 mSDtfsCounter, 577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc1 concLT1 SILN0 SILU0 SILI2 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax182 hnf100 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf90 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 18]: 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 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i >= 10) VAL [i=0, up=0] [L15] COND TRUE i <= 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up >= 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i >= 10) VAL [i=1, up=1] [L15] COND FALSE !(i <= 0) VAL [i=1, up=1] Loop: [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 18]: 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 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i >= 10) VAL [i=0, up=0] [L15] COND TRUE i <= 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up >= 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i >= 10) VAL [i=1, up=1] [L15] COND FALSE !(i <= 0) VAL [i=1, up=1] Loop: [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:21:37,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:38,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:38,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-09 15:21:38,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-09 15:21:38,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)