./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:16:07,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:16:07,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:16:07,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:16:07,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:16:07,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:16:07,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:16:07,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:16:07,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:16:07,840 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:16:07,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:16:07,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:16:07,841 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:16:07,842 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:16:07,842 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:16:07,842 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:16:07,843 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:16:07,843 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:16:07,843 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:16:07,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:16:07,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:16:07,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:16:07,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:16:07,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:16:07,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:16:07,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:16:07,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:16:07,846 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:16:07,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:16:07,847 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:16:07,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:16:07,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:16:07,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:16:07,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:16:07,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:16:07,849 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:16:07,849 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-19 14:16:08,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:16:08,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:16:08,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:16:08,154 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:16:08,155 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:16:08,156 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-19 14:16:09,603 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:16:09,796 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:16:09,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2024-11-19 14:16:09,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f23839f/27bc189acfe5427383d5e679bd3a2c9f/FLAG95c9bc2b1 [2024-11-19 14:16:10,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f23839f/27bc189acfe5427383d5e679bd3a2c9f [2024-11-19 14:16:10,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:16:10,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:16:10,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:16:10,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:16:10,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:16:10,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e660cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10, skipping insertion in model container [2024-11-19 14:16:10,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:16:10,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:16:10,378 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:16:10,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:16:10,398 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:16:10,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10 WrapperNode [2024-11-19 14:16:10,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:16:10,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:16:10,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:16:10,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:16:10,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,428 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-19 14:16:10,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:16:10,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:16:10,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:16:10,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:16:10,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,446 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 14:16:10,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:16:10,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:16:10,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:16:10,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:16:10,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (1/1) ... [2024-11-19 14:16:10,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:10,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:10,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:10,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:16:10,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:16:10,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:16:10,600 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:16:10,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:16:10,656 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-19 14:16:10,656 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:16:10,665 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:16:10,666 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:16:10,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:16:10 BoogieIcfgContainer [2024-11-19 14:16:10,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:16:10,667 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:16:10,667 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:16:10,672 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:16:10,673 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:16:10,673 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:16:10" (1/3) ... [2024-11-19 14:16:10,675 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b281b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:16:10, skipping insertion in model container [2024-11-19 14:16:10,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:16:10,675 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:10" (2/3) ... [2024-11-19 14:16:10,675 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b281b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:16:10, skipping insertion in model container [2024-11-19 14:16:10,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:16:10,676 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:16:10" (3/3) ... [2024-11-19 14:16:10,677 INFO L332 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2024-11-19 14:16:10,780 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:16:10,781 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:16:10,781 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:16:10,781 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:16:10,782 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:16:10,782 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:16:10,782 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:16:10,782 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:16:10,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:10,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:16:10,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:10,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:10,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:16:10,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:10,801 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:16:10,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:10,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:16:10,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:10,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:10,802 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:16:10,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:10,807 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4#L18-1true [2024-11-19 14:16:10,807 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-19 14:16:10,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:16:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117251586] [2024-11-19 14:16:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:10,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-11-19 14:16:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:10,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163734169] [2024-11-19 14:16:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:10,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2024-11-19 14:16:10,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:10,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884759434] [2024-11-19 14:16:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:10,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:11,032 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:11,033 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:11,033 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:11,033 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:11,033 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:11,033 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,033 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:11,034 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:11,034 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2024-11-19 14:16:11,034 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:11,034 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:11,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,143 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:11,144 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:11,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:16:11,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:11,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:11,171 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:11,172 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:11,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:16:11,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:16:11,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:11,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:11,211 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:11,211 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:11,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:11,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:16:11,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:11,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:11,266 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:11,266 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:11,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:11,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:16:11,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:11,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:11,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:16:11,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,306 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:16:11,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:11,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:11,323 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:11,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:16:11,339 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:11,339 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:11,339 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:11,340 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:11,340 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:11,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:11,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:11,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2024-11-19 14:16:11,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:11,340 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:11,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,420 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:11,424 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:11,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:16:11,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:11,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:11,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:11,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:11,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:11,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:11,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:11,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:11,465 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-19 14:16:11,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,467 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:16:11,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:11,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:11,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:11,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:11,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:11,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:11,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:11,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:11,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:16:11,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,505 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:16:11,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:11,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:11,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:11,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:11,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:11,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:11,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:11,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:11,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:11,524 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:11,525 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:16:11,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,552 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:16:11,554 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:11,554 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:11,554 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:11,555 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-19 14:16:11,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:11,574 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:11,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:11,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:11,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:11,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:11,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:11,700 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:11,702 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-19 14:16:11,773 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-19 14:16:11,776 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-19 14:16:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-11-19 14:16:11,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-19 14:16:11,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:11,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-19 14:16:11,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:11,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-19 14:16:11,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:11,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 45 transitions. [2024-11-19 14:16:11,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-19 14:16:11,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 30 transitions. [2024-11-19 14:16:11,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-19 14:16:11,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-19 14:16:11,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2024-11-19 14:16:11,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:11,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 30 transitions. [2024-11-19 14:16:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2024-11-19 14:16:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-19 14:16:11,819 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-19 14:16:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2024-11-19 14:16:11,820 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-11-19 14:16:11,820 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-11-19 14:16:11,821 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:16:11,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2024-11-19 14:16:11,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-19 14:16:11,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:11,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:11,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:16:11,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:11,822 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-19 14:16:11,823 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-19 14:16:11,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-11-19 14:16:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:11,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519390186] [2024-11-19 14:16:11,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:11,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:11,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:11,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:11,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2024-11-19 14:16:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894715181] [2024-11-19 14:16:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:11,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:11,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:11,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:11,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2024-11-19 14:16:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:11,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410237284] [2024-11-19 14:16:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:11,944 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-19 14:16:11,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:11,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410237284] [2024-11-19 14:16:11,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410237284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:16:11,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:16:11,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:16:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033629771] [2024-11-19 14:16:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:16:11,981 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:11,981 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:11,981 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:11,981 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:11,982 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:11,982 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,982 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:11,982 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:11,982 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2024-11-19 14:16:11,982 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:11,982 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:11,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,036 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:12,036 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:12,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,039 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:16:12,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:12,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:12,064 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:12,064 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:12,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:12,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,082 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:16:12,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:12,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:12,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:16:12,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,118 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:16:12,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:12,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:12,162 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:12,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-19 14:16:12,168 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:12,168 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:12,168 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:12,168 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:12,169 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:12,169 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,169 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:12,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:12,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2024-11-19 14:16:12,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:12,169 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:12,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,225 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:12,226 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:12,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,228 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:16:12,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:12,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:12,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:12,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:12,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:12,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:12,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:12,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:12,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:12,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,269 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:16:12,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:12,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:12,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:12,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:12,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:12,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:12,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:12,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:12,291 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:12,294 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:12,294 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:16:12,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,298 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,301 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:12,301 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:12,302 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:12,302 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-19 14:16:12,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:16:12,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:16:12,318 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:12,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:12,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:12,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:12,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:12,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:12,413 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-19 14:16:12,414 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-19 14:16:12,456 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-19 14:16:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-19 14:16:12,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-19 14:16:12,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:12,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2024-11-19 14:16:12,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:12,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 8 letters. [2024-11-19 14:16:12,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:12,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 73 transitions. [2024-11-19 14:16:12,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-19 14:16:12,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 36 states and 59 transitions. [2024-11-19 14:16:12,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-19 14:16:12,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-19 14:16:12,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 59 transitions. [2024-11-19 14:16:12,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:12,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 59 transitions. [2024-11-19 14:16:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 59 transitions. [2024-11-19 14:16:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2024-11-19 14:16:12,467 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-19 14:16:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2024-11-19 14:16:12,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 46 transitions. [2024-11-19 14:16:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:12,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:16:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:16:12,472 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-19 14:16:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:12,491 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2024-11-19 14:16:12,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 56 transitions. [2024-11-19 14:16:12,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:16:12,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 49 transitions. [2024-11-19 14:16:12,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-19 14:16:12,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-19 14:16:12,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2024-11-19 14:16:12,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:12,508 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-11-19 14:16:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2024-11-19 14:16:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2024-11-19 14:16:12,518 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-19 14:16:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2024-11-19 14:16:12,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 40 transitions. [2024-11-19 14:16:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:16:12,530 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2024-11-19 14:16:12,530 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:16:12,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2024-11-19 14:16:12,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:16:12,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:12,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:12,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:16:12,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:12,532 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-19 14:16:12,532 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-19 14:16:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2024-11-19 14:16:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:12,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26062590] [2024-11-19 14:16:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:12,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2024-11-19 14:16:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:12,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33921032] [2024-11-19 14:16:12,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:12,544 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-19 14:16:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:12,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2024-11-19 14:16:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:12,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109616033] [2024-11-19 14:16:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:12,627 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-19 14:16:12,666 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:12,667 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:12,667 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:12,667 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:12,667 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:12,667 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,667 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:12,667 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:12,667 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2024-11-19 14:16:12,668 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:12,668 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:12,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,735 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:12,735 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:12,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,737 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:16:12,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:12,741 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:12,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:12,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,772 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:16:12,776 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:12,776 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:12,869 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:12,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:16:12,876 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:12,876 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:12,876 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:12,876 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:12,876 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:12,876 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,876 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:12,876 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:12,877 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2024-11-19 14:16:12,877 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:12,877 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:12,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,936 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:12,936 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:12,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,938 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:16:12,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:12,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:12,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:12,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:12,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:12,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:12,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:12,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:12,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:12,960 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-19 14:16:12,960 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:16:12,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,963 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:16:12,965 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:12,965 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:12,965 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:12,966 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:16:12,980 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-19 14:16:12,981 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:12,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:12,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:12,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,023 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:13,024 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-19 14:16:13,057 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-19 14:16:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:13,060 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-19 14:16:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-19 14:16:13,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-19 14:16:13,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-19 14:16:13,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2024-11-19 14:16:13,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 90 transitions. [2024-11-19 14:16:13,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-19 14:16:13,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 85 transitions. [2024-11-19 14:16:13,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-19 14:16:13,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-19 14:16:13,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2024-11-19 14:16:13,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:13,067 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-11-19 14:16:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2024-11-19 14:16:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-11-19 14:16:13,073 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-19 14:16:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2024-11-19 14:16:13,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 79 transitions. [2024-11-19 14:16:13,075 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 79 transitions. [2024-11-19 14:16:13,075 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:16:13,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 79 transitions. [2024-11-19 14:16:13,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-19 14:16:13,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:13,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:13,076 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:16:13,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:13,077 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-19 14:16:13,077 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-19 14:16:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,077 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2024-11-19 14:16:13,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347049825] [2024-11-19 14:16:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347049825] [2024-11-19 14:16:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347049825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:16:13,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:16:13,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:16:13,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927723006] [2024-11-19 14:16:13,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:16:13,114 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:16:13,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2024-11-19 14:16:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451102513] [2024-11-19 14:16:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451102513] [2024-11-19 14:16:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451102513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:16:13,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:16:13,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:16:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857146585] [2024-11-19 14:16:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:16:13,143 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:16:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:16:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:16:13,144 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-19 14:16:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:13,159 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2024-11-19 14:16:13,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 69 transitions. [2024-11-19 14:16:13,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:16:13,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 60 transitions. [2024-11-19 14:16:13,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-19 14:16:13,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-19 14:16:13,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 60 transitions. [2024-11-19 14:16:13,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:13,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-11-19 14:16:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 60 transitions. [2024-11-19 14:16:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-19 14:16:13,166 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-19 14:16:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-11-19 14:16:13,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-11-19 14:16:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:16:13,169 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-11-19 14:16:13,169 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:16:13,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2024-11-19 14:16:13,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:16:13,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:13,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:13,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:16:13,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:13,171 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-19 14:16:13,171 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-19 14:16:13,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash 588716517, now seen corresponding path program 1 times [2024-11-19 14:16:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344149961] [2024-11-19 14:16:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,205 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-19 14:16:13,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:13,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344149961] [2024-11-19 14:16:13,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344149961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:16:13,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:16:13,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:16:13,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449133282] [2024-11-19 14:16:13,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:16:13,206 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:16:13,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1709112, now seen corresponding path program 1 times [2024-11-19 14:16:13,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758632864] [2024-11-19 14:16:13,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:13,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:13,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758632864] [2024-11-19 14:16:13,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758632864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:16:13,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:16:13,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:16:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760298287] [2024-11-19 14:16:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:16:13,238 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:16:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:13,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:16:13,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:16:13,239 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-19 14:16:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:13,252 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-11-19 14:16:13,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2024-11-19 14:16:13,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-19 14:16:13,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 60 transitions. [2024-11-19 14:16:13,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-19 14:16:13,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-19 14:16:13,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2024-11-19 14:16:13,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:13,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 60 transitions. [2024-11-19 14:16:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2024-11-19 14:16:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-11-19 14:16:13,261 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-19 14:16:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2024-11-19 14:16:13,262 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 54 transitions. [2024-11-19 14:16:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:16:13,265 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2024-11-19 14:16:13,265 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:16:13,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2024-11-19 14:16:13,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-19 14:16:13,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:13,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:13,266 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:16:13,266 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:13,266 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-19 14:16:13,266 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-19 14:16:13,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash 588716579, now seen corresponding path program 1 times [2024-11-19 14:16:13,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817994604] [2024-11-19 14:16:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:13,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817994604] [2024-11-19 14:16:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817994604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:16:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920229514] [2024-11-19 14:16:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:13,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:16:13,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,306 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-19 14:16:13,308 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-19 14:16:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:16:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920229514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:16:13,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:16:13,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 14:16:13,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513146199] [2024-11-19 14:16:13,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:16:13,373 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:16:13,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1709174, now seen corresponding path program 2 times [2024-11-19 14:16:13,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491435217] [2024-11-19 14:16:13,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:13,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,378 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:16:13,378 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:13,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:13,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:13,420 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:13,421 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:13,421 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:13,421 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:13,421 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:13,421 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,421 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:13,421 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:13,421 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2024-11-19 14:16:13,421 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:13,421 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:13,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,483 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:13,483 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:13,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,485 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:16:13,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:13,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:13,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-19 14:16:13,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,520 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:16:13,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:13,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:13,554 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:13,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:13,561 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:13,561 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:13,561 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:13,561 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:13,561 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:13,561 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,561 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:13,561 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:13,562 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2024-11-19 14:16:13,562 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:13,562 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:13,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,630 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:13,630 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:13,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,632 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:16:13,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:13,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:13,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:13,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:13,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:13,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:13,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:13,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:13,652 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:13,655 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:13,655 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:16:13,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,661 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:16:13,663 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:13,663 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:13,663 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:13,663 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:16:13,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:13,679 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:13,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,744 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:13,744 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-19 14:16:13,785 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-19 14:16:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-19 14:16:13,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-19 14:16:13,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 4 letters. [2024-11-19 14:16:13,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 8 letters. [2024-11-19 14:16:13,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 136 transitions. [2024-11-19 14:16:13,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-19 14:16:13,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 91 states and 122 transitions. [2024-11-19 14:16:13,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-19 14:16:13,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-19 14:16:13,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 122 transitions. [2024-11-19 14:16:13,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:13,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2024-11-19 14:16:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 122 transitions. [2024-11-19 14:16:13,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2024-11-19 14:16:13,800 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-19 14:16:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-11-19 14:16:13,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-11-19 14:16:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:13,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:16:13,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:16:13,804 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-19 14:16:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:13,857 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2024-11-19 14:16:13,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 174 transitions. [2024-11-19 14:16:13,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2024-11-19 14:16:13,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 108 states and 137 transitions. [2024-11-19 14:16:13,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-19 14:16:13,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-19 14:16:13,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 137 transitions. [2024-11-19 14:16:13,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:13,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 137 transitions. [2024-11-19 14:16:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 137 transitions. [2024-11-19 14:16:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2024-11-19 14:16:13,867 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-19 14:16:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2024-11-19 14:16:13,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 111 transitions. [2024-11-19 14:16:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:16:13,870 INFO L425 stractBuchiCegarLoop]: Abstraction has 86 states and 111 transitions. [2024-11-19 14:16:13,871 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:16:13,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 111 transitions. [2024-11-19 14:16:13,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-19 14:16:13,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:13,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:13,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:16:13,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:13,873 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-19 14:16:13,873 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-19 14:16:13,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1449615143, now seen corresponding path program 1 times [2024-11-19 14:16:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069372314] [2024-11-19 14:16:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:13,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:13,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:13,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 2 times [2024-11-19 14:16:13,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688335814] [2024-11-19 14:16:13,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:13,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,891 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:16:13,893 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:13,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:13,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:13,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,897 INFO L85 PathProgramCache]: Analyzing trace with hash -130036926, now seen corresponding path program 2 times [2024-11-19 14:16:13,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710072228] [2024-11-19 14:16:13,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:13,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,901 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:16:13,902 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:13,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:13,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:13,944 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:13,945 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:13,945 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:13,945 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:13,945 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:13,945 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,945 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:13,945 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:13,945 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2024-11-19 14:16:13,946 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:13,946 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:13,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,997 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:14,000 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:14,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,002 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:16:14,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:14,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,050 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-19 14:16:14,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-19 14:16:14,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,071 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:16:14,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:14,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,085 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:14,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,096 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:14,096 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:14,096 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:14,096 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:14,096 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:14,096 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,096 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:14,096 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:14,096 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2024-11-19 14:16:14,096 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:14,096 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:14,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,153 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:14,153 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:14,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,155 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:16:14,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:14,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:14,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:14,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:14,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:14,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:14,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:14,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:14,174 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:14,177 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:14,177 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:16:14,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,179 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:16:14,181 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:14,181 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:14,182 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:14,182 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-19 14:16:14,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,196 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:14,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:14,270 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:14,270 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-19 14:16:14,302 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-19 14:16:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:14,303 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-19 14:16:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-19 14:16:14,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-19 14:16:14,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-19 14:16:14,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2024-11-19 14:16:14,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 145 transitions. [2024-11-19 14:16:14,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-19 14:16:14,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 97 states and 125 transitions. [2024-11-19 14:16:14,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-19 14:16:14,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-19 14:16:14,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 125 transitions. [2024-11-19 14:16:14,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:14,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 125 transitions. [2024-11-19 14:16:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 125 transitions. [2024-11-19 14:16:14,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2024-11-19 14:16:14,310 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-19 14:16:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2024-11-19 14:16:14,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 112 transitions. [2024-11-19 14:16:14,311 INFO L425 stractBuchiCegarLoop]: Abstraction has 86 states and 112 transitions. [2024-11-19 14:16:14,311 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:16:14,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 112 transitions. [2024-11-19 14:16:14,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-19 14:16:14,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:14,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:14,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:16:14,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:14,312 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-19 14:16:14,312 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-19 14:16:14,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1818617978, now seen corresponding path program 1 times [2024-11-19 14:16:14,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:14,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426418857] [2024-11-19 14:16:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:14,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,366 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-19 14:16:14,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426418857] [2024-11-19 14:16:14,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426418857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:16:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905847436] [2024-11-19 14:16:14,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:14,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:16:14,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,369 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-19 14:16:14,370 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-19 14:16:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,420 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-19 14:16:14,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:16:14,453 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-19 14:16:14,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905847436] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:16:14,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:16:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 14:16:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373158744] [2024-11-19 14:16:14,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:16:14,455 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:16:14,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2024-11-19 14:16:14,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:14,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601070696] [2024-11-19 14:16:14,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:14,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:14,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:14,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:14,499 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:14,499 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:14,499 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:14,499 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:14,499 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:14,499 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:14,500 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:14,500 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2024-11-19 14:16:14,500 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:14,500 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:14,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,544 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:14,544 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,545 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:16:14,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:14,547 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,558 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:14,558 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:14,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,569 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:16:14,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:14,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,588 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:14,588 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-19 14:16:14,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-19 14:16:14,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,599 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-19 14:16:14,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:14,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,619 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:14,619 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-19 14:16:14,630 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-19 14:16:14,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,631 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:16:14,633 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:14,633 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-19 14:16:14,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,663 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-19 14:16:14,664 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-19 14:16:14,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:14,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,680 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:14,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-19 14:16:14,695 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:14,695 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:14,695 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:14,695 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:14,695 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:14,695 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,695 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:14,695 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:14,695 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2024-11-19 14:16:14,696 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:14,696 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:14,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,747 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:14,747 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:14,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,749 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-19 14:16:14,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:14,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:14,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:14,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:14,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:14,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:14,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:14,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:14,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:14,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,783 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-19 14:16:14,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:14,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:14,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:14,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:14,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:14,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:14,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:14,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:14,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,818 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-19 14:16:14,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:14,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:14,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:14,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:14,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:14,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:14,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:14,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:14,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,852 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:14,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-19 14:16:14,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:14,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:14,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:14,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:14,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:14,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:14,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:14,870 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:14,872 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:14,873 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:16:14,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,875 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-19 14:16:14,877 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:14,878 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:14,878 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:14,878 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:16:14,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-19 14:16:14,893 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:14,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:14,940 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:14,940 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-19 14:16:14,964 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-19 14:16:14,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:14,965 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-19 14:16:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-19 14:16:14,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-19 14:16:14,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2024-11-19 14:16:14,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2024-11-19 14:16:14,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 256 transitions. [2024-11-19 14:16:14,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-19 14:16:14,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 140 states and 182 transitions. [2024-11-19 14:16:14,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-19 14:16:14,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2024-11-19 14:16:14,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 182 transitions. [2024-11-19 14:16:14,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:14,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140 states and 182 transitions. [2024-11-19 14:16:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 182 transitions. [2024-11-19 14:16:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 94. [2024-11-19 14:16:14,975 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-19 14:16:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2024-11-19 14:16:14,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 124 transitions. [2024-11-19 14:16:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:14,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 14:16:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:16:14,976 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-19 14:16:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:15,028 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2024-11-19 14:16:15,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 178 transitions. [2024-11-19 14:16:15,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2024-11-19 14:16:15,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 150 states and 168 transitions. [2024-11-19 14:16:15,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-19 14:16:15,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-19 14:16:15,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 168 transitions. [2024-11-19 14:16:15,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:15,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 168 transitions. [2024-11-19 14:16:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 168 transitions. [2024-11-19 14:16:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2024-11-19 14:16:15,034 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-19 14:16:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2024-11-19 14:16:15,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 141 states and 158 transitions. [2024-11-19 14:16:15,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 14:16:15,036 INFO L425 stractBuchiCegarLoop]: Abstraction has 141 states and 158 transitions. [2024-11-19 14:16:15,036 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:16:15,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 158 transitions. [2024-11-19 14:16:15,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2024-11-19 14:16:15,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:15,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:15,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 9, 6, 4, 2, 1, 1, 1] [2024-11-19 14:16:15,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:15,038 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-19 14:16:15,038 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-19 14:16:15,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash 178061768, now seen corresponding path program 1 times [2024-11-19 14:16:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842113196] [2024-11-19 14:16:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,153 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-19 14:16:15,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842113196] [2024-11-19 14:16:15,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842113196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:16:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231796914] [2024-11-19 14:16:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:15,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:16:15,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,156 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-19 14:16:15,157 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-19 14:16:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,218 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-19 14:16:15,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:16:15,284 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-19 14:16:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231796914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:16:15,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:16:15,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-19 14:16:15,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678931991] [2024-11-19 14:16:15,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:16:15,285 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:16:15,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2024-11-19 14:16:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:15,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53425011] [2024-11-19 14:16:15,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:15,289 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:16:15,290 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:15,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:15,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:15,324 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:15,325 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:15,325 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:15,325 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:15,325 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:15,325 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,325 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:15,325 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:15,325 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2024-11-19 14:16:15,325 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:15,325 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:15,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,379 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:15,379 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:15,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,381 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-19 14:16:15,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:15,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:15,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-19 14:16:15,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,415 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-19 14:16:15,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:15,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:15,430 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:15,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:15,441 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:15,441 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:15,441 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:15,441 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:15,441 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:15,441 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,441 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:15,441 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:15,441 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2024-11-19 14:16:15,442 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:15,442 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:15,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,501 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:15,501 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:15,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,503 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-19 14:16:15,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:15,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:15,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:15,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:15,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:15,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:15,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:15,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:15,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:15,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:15,525 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:16:15,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,527 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-19 14:16:15,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:15,529 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:15,530 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:15,530 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:16:15,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-19 14:16:15,540 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:15,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:15,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-19 14:16:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:15,664 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:15,664 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-19 14:16:15,693 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-19 14:16:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:15,696 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-19 14:16:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-19 14:16:15,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 44 letters. Loop has 4 letters. [2024-11-19 14:16:15,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:15,698 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:15,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:15,800 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:15,800 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-19 14:16:15,828 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-19 14:16:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:15,829 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-19 14:16:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-19 14:16:15,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 44 letters. Loop has 4 letters. [2024-11-19 14:16:15,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:15,830 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:15,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:15,926 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:15,927 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-19 14:16:15,955 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-19 14:16:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:15,956 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-19 14:16:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-19 14:16:15,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 44 letters. Loop has 4 letters. [2024-11-19 14:16:15,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:15,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 48 letters. Loop has 4 letters. [2024-11-19 14:16:15,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:15,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 44 letters. Loop has 8 letters. [2024-11-19 14:16:15,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:15,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 211 transitions. [2024-11-19 14:16:15,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2024-11-19 14:16:15,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 144 states and 161 transitions. [2024-11-19 14:16:15,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-19 14:16:15,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-11-19 14:16:15,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 161 transitions. [2024-11-19 14:16:15,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:15,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 161 transitions. [2024-11-19 14:16:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 161 transitions. [2024-11-19 14:16:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2024-11-19 14:16:15,970 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-19 14:16:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2024-11-19 14:16:15,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 103 transitions. [2024-11-19 14:16:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:15,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 14:16:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-19 14:16:15,971 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-19 14:16:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:16,082 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2024-11-19 14:16:16,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 208 transitions. [2024-11-19 14:16:16,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2024-11-19 14:16:16,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 178 states and 195 transitions. [2024-11-19 14:16:16,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-19 14:16:16,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2024-11-19 14:16:16,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 195 transitions. [2024-11-19 14:16:16,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:16,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 178 states and 195 transitions. [2024-11-19 14:16:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 195 transitions. [2024-11-19 14:16:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2024-11-19 14:16:16,090 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-19 14:16:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2024-11-19 14:16:16,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 185 transitions. [2024-11-19 14:16:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 14:16:16,095 INFO L425 stractBuchiCegarLoop]: Abstraction has 168 states and 185 transitions. [2024-11-19 14:16:16,095 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:16:16,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 185 transitions. [2024-11-19 14:16:16,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-19 14:16:16,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:16,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:16,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2024-11-19 14:16:16,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2024-11-19 14:16:16,097 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-19 14:16:16,097 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-19 14:16:16,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1514411024, now seen corresponding path program 1 times [2024-11-19 14:16:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:16,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577093593] [2024-11-19 14:16:16,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:16,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:16,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:16,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:16,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1617023097, now seen corresponding path program 1 times [2024-11-19 14:16:16,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:16,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412197545] [2024-11-19 14:16:16,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:16,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:16,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:16,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash -883489176, now seen corresponding path program 2 times [2024-11-19 14:16:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:16,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202739602] [2024-11-19 14:16:16,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:16,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:16,161 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:16:16,165 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:16:16,329 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-19 14:16:16,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:16,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202739602] [2024-11-19 14:16:16,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202739602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:16:16,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830747396] [2024-11-19 14:16:16,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:16,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:16:16,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:16,332 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-19 14:16:16,333 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-19 14:16:16,381 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:16:16,381 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:16:16,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:16:16,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:16,425 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-19 14:16:16,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:16:16,516 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-19 14:16:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830747396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:16:16,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:16:16,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-19 14:16:16,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880885452] [2024-11-19 14:16:16,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:16:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 14:16:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-19 14:16:16,920 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-19 14:16:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:17,016 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2024-11-19 14:16:17,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 229 transitions. [2024-11-19 14:16:17,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-19 14:16:17,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 208 states and 223 transitions. [2024-11-19 14:16:17,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2024-11-19 14:16:17,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2024-11-19 14:16:17,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 223 transitions. [2024-11-19 14:16:17,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:17,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 208 states and 223 transitions. [2024-11-19 14:16:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 223 transitions. [2024-11-19 14:16:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 167. [2024-11-19 14:16:17,021 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-19 14:16:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2024-11-19 14:16:17,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 182 transitions. [2024-11-19 14:16:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 14:16:17,023 INFO L425 stractBuchiCegarLoop]: Abstraction has 167 states and 182 transitions. [2024-11-19 14:16:17,023 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:16:17,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 182 transitions. [2024-11-19 14:16:17,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-19 14:16:17,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:17,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:17,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:16:17,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2024-11-19 14:16:17,025 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-19 14:16:17,025 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-19 14:16:17,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash 644068259, now seen corresponding path program 2 times [2024-11-19 14:16:17,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:17,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135715785] [2024-11-19 14:16:17,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:17,030 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:16:17,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:17,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:17,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:17,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1888138361, now seen corresponding path program 2 times [2024-11-19 14:16:17,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:17,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36833273] [2024-11-19 14:16:17,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:17,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:17,043 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:16:17,045 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:17,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:17,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:17,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:17,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1126640613, now seen corresponding path program 3 times [2024-11-19 14:16:17,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:17,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819724592] [2024-11-19 14:16:17,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:16:17,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:17,067 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2024-11-19 14:16:17,067 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:17,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:17,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:17,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:17,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:16:17 BoogieIcfgContainer [2024-11-19 14:16:17,576 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:16:17,576 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:16:17,576 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:16:17,577 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:16:17,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:16:10" (3/4) ... [2024-11-19 14:16:17,578 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:16:17,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:16:17,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:16:17,629 INFO L158 Benchmark]: Toolchain (without parser) took 7438.72ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 124.0MB in the beginning and 119.8MB in the end (delta: 4.1MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-11-19 14:16:17,629 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 109.1MB. Free memory was 79.8MB in the beginning and 79.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:16:17,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.26ms. Allocated memory is still 157.3MB. Free memory was 124.0MB in the beginning and 112.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:16:17,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.09ms. Allocated memory is still 157.3MB. Free memory was 112.5MB in the beginning and 111.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:16:17,629 INFO L158 Benchmark]: Boogie Preprocessor took 23.92ms. Allocated memory is still 157.3MB. Free memory was 111.3MB in the beginning and 110.4MB in the end (delta: 985.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:16:17,630 INFO L158 Benchmark]: RCFGBuilder took 212.30ms. Allocated memory is still 157.3MB. Free memory was 110.4MB in the beginning and 100.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:16:17,630 INFO L158 Benchmark]: BuchiAutomizer took 6908.65ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 100.9MB in the beginning and 124.1MB in the end (delta: -23.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-19 14:16:17,630 INFO L158 Benchmark]: Witness Printer took 51.77ms. Allocated memory is still 188.7MB. Free memory was 124.1MB in the beginning and 119.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 14:16:17,631 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.55ms. Allocated memory is still 109.1MB. Free memory was 79.8MB in the beginning and 79.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.26ms. Allocated memory is still 157.3MB. Free memory was 124.0MB in the beginning and 112.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.09ms. Allocated memory is still 157.3MB. Free memory was 112.5MB in the beginning and 111.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.92ms. Allocated memory is still 157.3MB. Free memory was 111.3MB in the beginning and 110.4MB in the end (delta: 985.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 212.30ms. Allocated memory is still 157.3MB. Free memory was 110.4MB in the beginning and 100.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 6908.65ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 100.9MB in the beginning and 124.1MB in the end (delta: -23.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Witness Printer took 51.77ms. Allocated memory is still 188.7MB. Free memory was 124.1MB in the beginning and 119.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.7s and 11 iterations. TraceHistogramMax:20. Analysis of lassos took 5.0s. Construction of modules took 0.4s. Büchi inclusion checks took 1.1s. 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: 29ms 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-19 14:16:17,655 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-19 14:16:17,851 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-19 14:16:18,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:18,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:18,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)