./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_22.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 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:21:06,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:21:06,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:21:06,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:21:06,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:21:06,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:21:06,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:21:06,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:21:06,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:21:06,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:21:06,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:21:06,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:21:06,384 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:21:06,384 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:21:06,384 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:21:06,385 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:21:06,388 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:21:06,388 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:21:06,389 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:21:06,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:21:06,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:21:06,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:21:06,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:21:06,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:21:06,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:21:06,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:21:06,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:21:06,394 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:21:06,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:21:06,395 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:21:06,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:21:06,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:21:06,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:21:06,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:21:06,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:21:06,397 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:21:06,397 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 -> 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 [2024-11-09 15:21:06,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:21:06,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:21:06,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:21:06,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:21:06,677 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:21:06,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_22.c [2024-11-09 15:21:08,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:21:08,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:21:08,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2024-11-09 15:21:08,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4352ed0/2e5dba0cfd7d49f0bc4fd220551d0856/FLAG1db7864af [2024-11-09 15:21:08,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4352ed0/2e5dba0cfd7d49f0bc4fd220551d0856 [2024-11-09 15:21:08,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:21:08,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:21:08,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:21:08,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:21:08,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:21:08,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:21:08" (1/1) ... [2024-11-09 15:21:08,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcbb8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:08, skipping insertion in model container [2024-11-09 15:21:08,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:21:08" (1/1) ... [2024-11-09 15:21:08,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:21:08,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:21:08,988 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:21:08,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:21:09,012 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:21:09,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09 WrapperNode [2024-11-09 15:21:09,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:21:09,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:21:09,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:21:09,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:21:09,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,041 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2024-11-09 15:21:09,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:21:09,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:21:09,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:21:09,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:21:09,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,059 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 15:21:09,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:21:09,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:21:09,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:21:09,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:21:09,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (1/1) ... [2024-11-09 15:21:09,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:09,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:09,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:21:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:21:09,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:21:09,201 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:21:09,202 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:21:09,238 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-09 15:21:09,238 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:21:09,256 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:21:09,256 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:21:09,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:21:09 BoogieIcfgContainer [2024-11-09 15:21:09,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:21:09,258 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:21:09,258 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:21:09,262 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:21:09,263 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:21:09,263 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:21:08" (1/3) ... [2024-11-09 15:21:09,264 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aee661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:21:09, skipping insertion in model container [2024-11-09 15:21:09,265 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:21:09,265 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:09" (2/3) ... [2024-11-09 15:21:09,266 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aee661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:21:09, skipping insertion in model container [2024-11-09 15:21:09,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:21:09,267 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:21:09" (3/3) ... [2024-11-09 15:21:09,269 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2024-11-09 15:21:09,363 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:21:09,363 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:21:09,363 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:21:09,363 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:21:09,363 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:21:09,363 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:21:09,364 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:21:09,364 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:21:09,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:09,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:09,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:09,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:21:09,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:09,389 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:21:09,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:09,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:09,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:09,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:21:09,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:09,396 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 3#L10-2true [2024-11-09 15:21:09,396 INFO L747 eck$LassoCheckResult]: Loop: 3#L10-2true assume !!(main_~i~0#1 < 100); 5#L10true assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 3#L10-2true [2024-11-09 15:21:09,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:21:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:09,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043673305] [2024-11-09 15:21:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:09,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:09,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:09,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2024-11-09 15:21:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:09,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347220136] [2024-11-09 15:21:09,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:09,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:09,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:09,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:09,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2024-11-09 15:21:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:09,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749729595] [2024-11-09 15:21:09,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:09,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:09,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749729595] [2024-11-09 15:21:09,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749729595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:21:09,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:21:09,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:21:09,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078840327] [2024-11-09 15:21:09,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:21:09,696 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:09,696 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:09,696 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:09,697 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:09,697 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:09,697 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,697 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:09,697 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:09,697 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2024-11-09 15:21:09,698 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:09,698 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:09,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,808 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:09,809 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:09,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:09,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:09,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:21:09,817 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:09,817 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:09,845 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:09,845 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:09,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-09 15:21:09,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:09,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:09,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:21:09,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:09,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:09,885 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:09,885 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:09,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:21:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:09,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:09,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:21:09,899 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:09,899 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:09,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-09 15:21:09,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:09,925 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:09,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:21:09,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:09,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:09,941 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:09,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:09,958 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:09,958 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:09,958 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:09,958 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:09,958 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:09,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:09,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:09,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2024-11-09 15:21:09,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:09,959 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:09,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,046 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:10,050 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:10,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:21:10,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:10,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:10,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:10,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:10,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:10,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:10,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:10,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:10,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:21:10,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,105 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:21:10,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:10,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:10,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:10,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:10,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:10,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:10,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:10,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:10,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:21:10,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,151 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:21:10,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:10,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:10,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:10,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:10,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:10,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:10,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:10,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:10,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:10,183 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:10,184 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:21:10,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,207 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:21:10,209 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:10,209 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:10,209 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:10,210 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-09 15:21:10,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:10,223 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:10,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:10,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:10,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:10,264 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:10,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:10,302 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-09 15:21:10,303 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:10,339 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 24 transitions. Complement of second has 6 states. [2024-11-09 15:21:10,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-09 15:21:10,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-09 15:21:10,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:10,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-09 15:21:10,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:10,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-09 15:21:10,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:10,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 24 transitions. [2024-11-09 15:21:10,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:10,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 8 states and 11 transitions. [2024-11-09 15:21:10,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:21:10,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-09 15:21:10,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2024-11-09 15:21:10,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:10,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-11-09 15:21:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2024-11-09 15:21:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-09 15:21:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2024-11-09 15:21:10,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-11-09 15:21:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:10,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:21:10,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:21:10,374 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:10,383 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2024-11-09 15:21:10,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2024-11-09 15:21:10,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:10,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2024-11-09 15:21:10,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-09 15:21:10,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-09 15:21:10,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2024-11-09 15:21:10,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:21:10,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-09 15:21:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2024-11-09 15:21:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-11-09 15:21:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2024-11-09 15:21:10,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-09 15:21:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:21:10,387 INFO L425 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-09 15:21:10,387 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:21:10,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2024-11-09 15:21:10,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:10,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:10,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:10,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:21:10,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:10,389 INFO L745 eck$LassoCheckResult]: Stem: 79#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 80#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 81#L10-2 assume !!(main_~i~0#1 < 100); 78#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 76#L10-2 [2024-11-09 15:21:10,389 INFO L747 eck$LassoCheckResult]: Loop: 76#L10-2 assume !!(main_~i~0#1 < 100); 77#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 76#L10-2 [2024-11-09 15:21:10,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-11-09 15:21:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:10,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741283351] [2024-11-09 15:21:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:10,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:10,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:10,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2024-11-09 15:21:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:10,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018204478] [2024-11-09 15:21:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:10,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:10,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:10,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2024-11-09 15:21:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527269134] [2024-11-09 15:21:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:10,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:10,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:10,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527269134] [2024-11-09 15:21:10,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527269134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:10,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311559893] [2024-11-09 15:21:10,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:10,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:10,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,465 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 15:21:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:10,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:21:10,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:10,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:10,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311559893] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:10,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:10,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-09 15:21:10,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546662885] [2024-11-09 15:21:10,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:10,570 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:10,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:10,571 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:10,571 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:10,571 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:10,571 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,571 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:10,571 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:10,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2024-11-09 15:21:10,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:10,571 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:10,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,625 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:10,625 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:10,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,628 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:21:10,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:10,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:10,653 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:10,653 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:10,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:21:10,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,671 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:21:10,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:10,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:10,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:21:10,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,698 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:21:10,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:10,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:10,715 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:10,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:10,729 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:10,729 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:10,729 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:10,730 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:10,730 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:10,730 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,730 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:10,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:10,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2024-11-09 15:21:10,730 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:10,730 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:10,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:10,788 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:10,788 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:10,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,791 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:21:10,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:10,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:10,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:10,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:10,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:10,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:10,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:10,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:10,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:21:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,834 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:21:10,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:10,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:10,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:10,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:10,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:10,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:10,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:10,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:10,850 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:10,854 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:10,854 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:21:10,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:10,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,856 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:21:10,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:10,857 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:10,858 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:10,858 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-09 15:21:10,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:10,869 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:10,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:10,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:10,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:10,900 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:10,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:10,904 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-09 15:21:10,904 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:10,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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 10 states and 13 transitions. Complement of second has 5 states. [2024-11-09 15:21:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-09 15:21:10,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-09 15:21:10,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:10,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-09 15:21:10,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:10,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-09 15:21:10,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:10,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2024-11-09 15:21:10,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:10,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2024-11-09 15:21:10,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-09 15:21:10,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-09 15:21:10,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2024-11-09 15:21:10,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:10,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-09 15:21:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2024-11-09 15:21:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-09 15:21:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2024-11-09 15:21:10,924 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-09 15:21:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:21:10,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:21:10,941 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:10,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:21:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:10,973 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-09 15:21:10,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-09 15:21:10,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:10,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2024-11-09 15:21:10,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-09 15:21:10,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:21:10,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2024-11-09 15:21:10,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:21:10,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-09 15:21:10,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2024-11-09 15:21:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 15:21:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-09 15:21:10,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-09 15:21:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:21:10,978 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-09 15:21:10,978 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:21:10,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2024-11-09 15:21:10,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:10,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:10,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:10,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2024-11-09 15:21:10,979 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:10,979 INFO L745 eck$LassoCheckResult]: Stem: 189#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 191#L10-2 assume !!(main_~i~0#1 < 100); 188#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 186#L10-2 assume !!(main_~i~0#1 < 100); 187#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 197#L10-2 assume !!(main_~i~0#1 < 100); 196#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 195#L10-2 assume !!(main_~i~0#1 < 100); 194#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 193#L10-2 [2024-11-09 15:21:10,979 INFO L747 eck$LassoCheckResult]: Loop: 193#L10-2 assume !!(main_~i~0#1 < 100); 192#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 193#L10-2 [2024-11-09 15:21:10,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:10,980 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2024-11-09 15:21:10,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:10,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052688239] [2024-11-09 15:21:10,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:10,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:10,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:10,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:10,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:10,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:10,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2024-11-09 15:21:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:10,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058574839] [2024-11-09 15:21:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:11,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:11,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:11,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:11,006 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2024-11-09 15:21:11,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:11,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657400639] [2024-11-09 15:21:11,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657400639] [2024-11-09 15:21:11,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657400639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206386163] [2024-11-09 15:21:11,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:21:11,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:11,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:11,136 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:11,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 15:21:11,174 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:21:11,174 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:11,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:21:11,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:11,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206386163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:11,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:11,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 15:21:11,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718714954] [2024-11-09 15:21:11,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:11,325 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:11,326 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:11,326 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:11,327 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:11,327 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:11,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:11,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:11,327 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:11,327 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2024-11-09 15:21:11,327 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:11,328 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:11,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:11,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:11,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:11,377 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:11,377 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:11,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:11,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:11,379 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:11,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:21:11,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:11,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:11,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-09 15:21:11,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:11,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:11,421 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:11,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:21:11,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:11,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:11,441 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:11,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:21:11,456 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:11,456 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:11,456 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:11,456 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:11,457 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:11,457 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:11,457 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:11,457 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:11,457 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2024-11-09 15:21:11,457 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:11,458 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:11,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:11,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:11,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:11,512 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:11,512 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:11,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:11,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:11,514 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:11,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:21:11,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:11,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:11,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:11,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:11,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:11,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:11,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:11,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:11,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:11,541 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:11,542 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:21:11,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:11,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:11,545 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:11,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:21:11,546 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:11,546 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:11,547 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:11,547 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-09 15:21:11,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:21:11,563 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:11,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:11,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:11,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:11,600 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:11,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:11,604 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-09 15:21:11,604 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,614 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. 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) Result 13 states and 14 transitions. Complement of second has 5 states. [2024-11-09 15:21:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-09 15:21:11,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-09 15:21:11,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:11,615 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:11,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:11,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:11,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:11,671 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:11,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:11,675 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-09 15:21:11,675 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,681 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. 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) Result 13 states and 14 transitions. Complement of second has 5 states. [2024-11-09 15:21:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-09 15:21:11,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-09 15:21:11,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:11,683 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:11,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:11,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:11,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:11,725 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:11,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:11,728 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 1 loop predicates [2024-11-09 15:21:11,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,737 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. 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) Result 17 states and 19 transitions. Complement of second has 4 states. [2024-11-09 15:21:11,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-09 15:21:11,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-09 15:21:11,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:11,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2024-11-09 15:21:11,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:11,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-09 15:21:11,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:11,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2024-11-09 15:21:11,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:11,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2024-11-09 15:21:11,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-09 15:21:11,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:21:11,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-11-09 15:21:11,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:11,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-09 15:21:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-11-09 15:21:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-09 15:21:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-09 15:21:11,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-09 15:21:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:11,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 15:21:11,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-09 15:21:11,745 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:11,790 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-09 15:21:11,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2024-11-09 15:21:11,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:11,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2024-11-09 15:21:11,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-09 15:21:11,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 15:21:11,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2024-11-09 15:21:11,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:11,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 15:21:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2024-11-09 15:21:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-09 15:21:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-09 15:21:11,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-09 15:21:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 15:21:11,799 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-09 15:21:11,799 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:21:11,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2024-11-09 15:21:11,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:11,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:11,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:11,801 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2024-11-09 15:21:11,801 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:11,801 INFO L745 eck$LassoCheckResult]: Stem: 502#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 503#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 504#L10-2 assume !!(main_~i~0#1 < 100); 501#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 496#L10-2 assume !!(main_~i~0#1 < 100); 497#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 520#L10-2 assume !!(main_~i~0#1 < 100); 519#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 518#L10-2 assume !!(main_~i~0#1 < 100); 517#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 516#L10-2 assume !!(main_~i~0#1 < 100); 515#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 514#L10-2 assume !!(main_~i~0#1 < 100); 513#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 512#L10-2 assume !!(main_~i~0#1 < 100); 511#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 510#L10-2 assume !!(main_~i~0#1 < 100); 509#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 508#L10-2 assume !!(main_~i~0#1 < 100); 507#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 506#L10-2 assume !!(main_~i~0#1 < 100); 500#L10 [2024-11-09 15:21:11,801 INFO L747 eck$LassoCheckResult]: Loop: 500#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 505#L10-2 assume !!(main_~i~0#1 < 100); 500#L10 [2024-11-09 15:21:11,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2024-11-09 15:21:11,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:11,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390869712] [2024-11-09 15:21:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:11,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:11,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:11,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2024-11-09 15:21:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:11,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229180890] [2024-11-09 15:21:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:11,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:11,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:11,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:11,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2024-11-09 15:21:11,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:11,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526505138] [2024-11-09 15:21:11,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:11,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:11,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:11,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:11,892 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:11,892 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:11,892 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:11,892 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:11,892 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:11,892 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:11,892 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:11,892 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:11,892 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2024-11-09 15:21:11,893 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:11,893 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:11,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:11,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:11,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:11,932 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:11,932 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:11,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:11,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:11,934 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:11,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:21:11,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:11,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:11,956 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:11,956 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:11,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:11,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:11,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:11,969 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:11,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:21:11,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:11,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:11,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:21:11,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:11,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:11,994 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:11,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:21:11,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:11,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:12,029 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:12,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-09 15:21:12,035 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:12,036 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:12,036 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:12,036 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:12,036 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:12,036 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:12,036 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:12,036 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:12,036 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2024-11-09 15:21:12,036 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:12,036 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:12,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:12,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:12,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:12,086 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:12,087 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:12,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:12,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:12,089 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:12,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:12,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:21:12,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:12,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:12,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:12,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:12,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:12,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:12,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:12,110 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:12,113 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:12,113 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:12,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:12,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:12,116 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:12,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:21:12,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:12,119 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:12,119 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:12,119 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2024-11-09 15:21:12,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-09 15:21:12,135 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:12,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:12,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:12,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:12,217 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:12,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:12,236 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:12,236 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:12,249 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3. 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) Result 38 states and 42 transitions. Complement of second has 5 states. [2024-11-09 15:21:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-09 15:21:12,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-09 15:21:12,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:12,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-09 15:21:12,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:12,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2024-11-09 15:21:12,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:12,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2024-11-09 15:21:12,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:12,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2024-11-09 15:21:12,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-09 15:21:12,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-09 15:21:12,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2024-11-09 15:21:12,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:12,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-09 15:21:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2024-11-09 15:21:12,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-09 15:21:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-09 15:21:12,263 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-09 15:21:12,263 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-09 15:21:12,263 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:21:12,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2024-11-09 15:21:12,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:12,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:12,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:12,265 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2024-11-09 15:21:12,265 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:12,265 INFO L745 eck$LassoCheckResult]: Stem: 656#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 657#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 658#L10-2 assume !!(main_~i~0#1 < 100); 653#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 654#L10-2 assume !!(main_~i~0#1 < 100); 655#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 651#L10-2 assume !!(main_~i~0#1 < 100); 652#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 674#L10-2 assume !!(main_~i~0#1 < 100); 673#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 672#L10-2 assume !!(main_~i~0#1 < 100); 671#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 670#L10-2 assume !!(main_~i~0#1 < 100); 669#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 668#L10-2 assume !!(main_~i~0#1 < 100); 667#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 666#L10-2 assume !!(main_~i~0#1 < 100); 665#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 664#L10-2 assume !!(main_~i~0#1 < 100); 663#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 662#L10-2 assume !!(main_~i~0#1 < 100); 661#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 660#L10-2 assume !!(main_~i~0#1 < 100); 649#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 659#L10-2 assume !!(main_~i~0#1 < 100); 650#L10 [2024-11-09 15:21:12,265 INFO L747 eck$LassoCheckResult]: Loop: 650#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 648#L10-2 assume !!(main_~i~0#1 < 100); 650#L10 [2024-11-09 15:21:12,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2024-11-09 15:21:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:12,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676889794] [2024-11-09 15:21:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676889794] [2024-11-09 15:21:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676889794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185481142] [2024-11-09 15:21:12,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:21:12,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:12,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:12,475 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:12,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-09 15:21:12,509 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-09 15:21:12,509 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:12,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:21:12,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:12,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:12,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-09 15:21:12,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185481142] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:12,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:12,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-11-09 15:21:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396257052] [2024-11-09 15:21:12,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:12,820 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:12,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2024-11-09 15:21:12,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:12,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858734197] [2024-11-09 15:21:12,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:12,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:12,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:12,842 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:12,842 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:12,842 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:12,842 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:12,842 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:12,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:12,842 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:12,842 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:12,842 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2024-11-09 15:21:12,842 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:12,842 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:12,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:12,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:12,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:12,880 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:12,880 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:12,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:12,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:12,882 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:12,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:21:12,884 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:12,884 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:12,908 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:12,908 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:12,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-09 15:21:12,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:12,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:12,924 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:12,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:21:12,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:12,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:12,949 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:12,950 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:21:12,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:12,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:12,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:12,966 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:12,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:21:12,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:12,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:12,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-09 15:21:12,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:12,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:12,990 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:12,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:21:12,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:12,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:13,018 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:13,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-09 15:21:13,023 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:13,023 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:13,023 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:13,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:13,023 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:13,023 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:13,023 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:13,023 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:13,023 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2024-11-09 15:21:13,023 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:13,023 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:13,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:13,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:13,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:13,066 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:13,067 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:13,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:13,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:13,069 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:13,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:21:13,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:13,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:13,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:13,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:13,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:13,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:13,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:13,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:13,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:13,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:13,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:13,098 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:13,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 15:21:13,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:13,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:13,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:13,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:13,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:13,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:13,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:13,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:13,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-09 15:21:13,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:13,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:13,131 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:13,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:21:13,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:13,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:13,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:13,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:13,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:13,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:13,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:13,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:13,151 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:13,153 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:13,153 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:13,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:13,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:13,156 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:13,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:21:13,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:13,157 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:13,158 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:13,158 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2024-11-09 15:21:13,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-09 15:21:13,173 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:13,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:13,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:13,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:13,231 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:13,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:13,250 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:13,251 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:13,264 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 42 transitions. Complement of second has 5 states. [2024-11-09 15:21:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-09 15:21:13,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-09 15:21:13,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:13,265 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:13,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:13,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:13,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:13,315 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:13,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:13,332 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:13,332 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:13,348 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 43 transitions. Complement of second has 5 states. [2024-11-09 15:21:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-09 15:21:13,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-09 15:21:13,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:13,350 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:13,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:13,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:13,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:13,407 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:13,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:13,421 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:13,421 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:13,437 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 45 transitions. Complement of second has 4 states. [2024-11-09 15:21:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-09 15:21:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-09 15:21:13,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-09 15:21:13,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:13,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2024-11-09 15:21:13,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:13,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2024-11-09 15:21:13,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:21:13,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2024-11-09 15:21:13,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:21:13,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-09 15:21:13,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2024-11-09 15:21:13,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:13,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-09 15:21:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2024-11-09 15:21:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-09 15:21:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-09 15:21:13,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 15:21:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:13,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 15:21:13,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-09 15:21:13,448 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:13,517 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-11-09 15:21:13,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2024-11-09 15:21:13,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:13,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2024-11-09 15:21:13,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:21:13,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-09 15:21:13,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2024-11-09 15:21:13,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:13,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-09 15:21:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2024-11-09 15:21:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-09 15:21:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-11-09 15:21:13,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-09 15:21:13,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 15:21:13,525 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-09 15:21:13,525 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:21:13,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2024-11-09 15:21:13,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:13,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:13,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:13,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2024-11-09 15:21:13,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-09 15:21:13,527 INFO L745 eck$LassoCheckResult]: Stem: 1323#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1324#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1317#L10-2 assume !!(main_~i~0#1 < 100); 1318#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1321#L10-2 assume !!(main_~i~0#1 < 100); 1322#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1319#L10-2 assume !!(main_~i~0#1 < 100); 1320#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1366#L10-2 assume !!(main_~i~0#1 < 100); 1365#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1364#L10-2 assume !!(main_~i~0#1 < 100); 1363#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1362#L10-2 assume !!(main_~i~0#1 < 100); 1361#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1360#L10-2 assume !!(main_~i~0#1 < 100); 1359#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1358#L10-2 assume !!(main_~i~0#1 < 100); 1357#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1356#L10-2 assume !!(main_~i~0#1 < 100); 1355#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1354#L10-2 assume !!(main_~i~0#1 < 100); 1353#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1352#L10-2 assume !!(main_~i~0#1 < 100); 1351#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1350#L10-2 assume !!(main_~i~0#1 < 100); 1349#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1348#L10-2 assume !!(main_~i~0#1 < 100); 1347#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1346#L10-2 assume !!(main_~i~0#1 < 100); 1345#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1344#L10-2 assume !!(main_~i~0#1 < 100); 1343#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1342#L10-2 assume !!(main_~i~0#1 < 100); 1341#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1340#L10-2 assume !!(main_~i~0#1 < 100); 1339#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1338#L10-2 assume !!(main_~i~0#1 < 100); 1337#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1336#L10-2 assume !!(main_~i~0#1 < 100); 1335#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1334#L10-2 assume !!(main_~i~0#1 < 100); 1333#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1332#L10-2 assume !!(main_~i~0#1 < 100); 1331#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1330#L10-2 assume !!(main_~i~0#1 < 100); 1329#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1328#L10-2 assume !!(main_~i~0#1 < 100); 1326#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1325#L10-2 assume !!(main_~i~0#1 < 100); 1327#L10 [2024-11-09 15:21:13,527 INFO L747 eck$LassoCheckResult]: Loop: 1327#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1328#L10-2 assume !!(main_~i~0#1 < 100); 1326#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1325#L10-2 assume !!(main_~i~0#1 < 100); 1327#L10 [2024-11-09 15:21:13,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2024-11-09 15:21:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:13,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984079688] [2024-11-09 15:21:13,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:13,773 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-09 15:21:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984079688] [2024-11-09 15:21:14,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984079688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391758830] [2024-11-09 15:21:14,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:21:14,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:14,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:14,004 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:14,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-09 15:21:14,049 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:21:14,049 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:14,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:21:14,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:14,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:14,865 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:14,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391758830] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:14,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:14,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-11-09 15:21:14,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602764271] [2024-11-09 15:21:14,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:14,866 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2024-11-09 15:21:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309844575] [2024-11-09 15:21:14,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:14,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:14,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:14,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 15:21:14,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 15:21:14,901 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:15,046 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2024-11-09 15:21:15,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2024-11-09 15:21:15,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:15,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2024-11-09 15:21:15,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:21:15,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-09 15:21:15,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2024-11-09 15:21:15,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:15,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2024-11-09 15:21:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2024-11-09 15:21:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-09 15:21:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2024-11-09 15:21:15,054 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-11-09 15:21:15,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-09 15:21:15,055 INFO L425 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-11-09 15:21:15,055 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:21:15,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2024-11-09 15:21:15,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:15,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:15,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:15,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2024-11-09 15:21:15,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-09 15:21:15,059 INFO L745 eck$LassoCheckResult]: Stem: 1835#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1836#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1829#L10-2 assume !!(main_~i~0#1 < 100); 1830#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1833#L10-2 assume !!(main_~i~0#1 < 100); 1834#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1831#L10-2 assume !!(main_~i~0#1 < 100); 1832#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1926#L10-2 assume !!(main_~i~0#1 < 100); 1925#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1924#L10-2 assume !!(main_~i~0#1 < 100); 1923#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1922#L10-2 assume !!(main_~i~0#1 < 100); 1921#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1920#L10-2 assume !!(main_~i~0#1 < 100); 1919#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1918#L10-2 assume !!(main_~i~0#1 < 100); 1917#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1916#L10-2 assume !!(main_~i~0#1 < 100); 1915#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1914#L10-2 assume !!(main_~i~0#1 < 100); 1913#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1912#L10-2 assume !!(main_~i~0#1 < 100); 1911#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1910#L10-2 assume !!(main_~i~0#1 < 100); 1909#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1908#L10-2 assume !!(main_~i~0#1 < 100); 1907#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1906#L10-2 assume !!(main_~i~0#1 < 100); 1905#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1904#L10-2 assume !!(main_~i~0#1 < 100); 1903#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1902#L10-2 assume !!(main_~i~0#1 < 100); 1901#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1900#L10-2 assume !!(main_~i~0#1 < 100); 1899#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1898#L10-2 assume !!(main_~i~0#1 < 100); 1897#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1896#L10-2 assume !!(main_~i~0#1 < 100); 1895#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1894#L10-2 assume !!(main_~i~0#1 < 100); 1893#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1892#L10-2 assume !!(main_~i~0#1 < 100); 1891#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1890#L10-2 assume !!(main_~i~0#1 < 100); 1889#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1888#L10-2 assume !!(main_~i~0#1 < 100); 1887#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1886#L10-2 assume !!(main_~i~0#1 < 100); 1885#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1884#L10-2 assume !!(main_~i~0#1 < 100); 1883#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1882#L10-2 assume !!(main_~i~0#1 < 100); 1881#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1880#L10-2 assume !!(main_~i~0#1 < 100); 1879#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1878#L10-2 assume !!(main_~i~0#1 < 100); 1877#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1876#L10-2 assume !!(main_~i~0#1 < 100); 1875#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1874#L10-2 assume !!(main_~i~0#1 < 100); 1873#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1872#L10-2 assume !!(main_~i~0#1 < 100); 1871#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1870#L10-2 assume !!(main_~i~0#1 < 100); 1869#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1868#L10-2 assume !!(main_~i~0#1 < 100); 1867#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1866#L10-2 assume !!(main_~i~0#1 < 100); 1865#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1864#L10-2 assume !!(main_~i~0#1 < 100); 1863#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1862#L10-2 assume !!(main_~i~0#1 < 100); 1861#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1860#L10-2 assume !!(main_~i~0#1 < 100); 1859#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1858#L10-2 assume !!(main_~i~0#1 < 100); 1857#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1856#L10-2 assume !!(main_~i~0#1 < 100); 1855#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1854#L10-2 assume !!(main_~i~0#1 < 100); 1853#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1852#L10-2 assume !!(main_~i~0#1 < 100); 1851#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1850#L10-2 assume !!(main_~i~0#1 < 100); 1849#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1848#L10-2 assume !!(main_~i~0#1 < 100); 1847#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1846#L10-2 assume !!(main_~i~0#1 < 100); 1845#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1844#L10-2 assume !!(main_~i~0#1 < 100); 1843#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1842#L10-2 assume !!(main_~i~0#1 < 100); 1841#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1840#L10-2 assume !!(main_~i~0#1 < 100); 1838#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1837#L10-2 assume !!(main_~i~0#1 < 100); 1839#L10 [2024-11-09 15:21:15,059 INFO L747 eck$LassoCheckResult]: Loop: 1839#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1840#L10-2 assume !!(main_~i~0#1 < 100); 1838#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1837#L10-2 assume !!(main_~i~0#1 < 100); 1839#L10 [2024-11-09 15:21:15,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2024-11-09 15:21:15,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:15,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778162607] [2024-11-09 15:21:15,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:15,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778162607] [2024-11-09 15:21:16,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778162607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173689421] [2024-11-09 15:21:16,538 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 15:21:16,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:16,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:16,540 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:16,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-09 15:21:16,612 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2024-11-09 15:21:16,612 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:16,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 15:21:16,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:16,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173689421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:17,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:17,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2024-11-09 15:21:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137294564] [2024-11-09 15:21:17,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:17,922 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:17,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2024-11-09 15:21:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:17,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367466348] [2024-11-09 15:21:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:17,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:17,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:17,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:17,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:17,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 15:21:17,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 15:21:17,952 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 52 states, 52 states have (on average 2.019230769230769) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:18,107 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2024-11-09 15:21:18,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 113 transitions. [2024-11-09 15:21:18,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:18,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 109 transitions. [2024-11-09 15:21:18,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:21:18,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-09 15:21:18,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 109 transitions. [2024-11-09 15:21:18,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:18,109 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2024-11-09 15:21:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 109 transitions. [2024-11-09 15:21:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-09 15:21:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 105 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2024-11-09 15:21:18,114 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 108 transitions. [2024-11-09 15:21:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-09 15:21:18,115 INFO L425 stractBuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2024-11-09 15:21:18,115 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:21:18,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2024-11-09 15:21:18,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:18,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:18,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:18,117 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [52, 50, 1, 1, 1] [2024-11-09 15:21:18,117 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-09 15:21:18,117 INFO L745 eck$LassoCheckResult]: Stem: 2675#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2676#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2669#L10-2 assume !!(main_~i~0#1 < 100); 2670#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2673#L10-2 assume !!(main_~i~0#1 < 100); 2674#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2671#L10-2 assume !!(main_~i~0#1 < 100); 2672#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2774#L10-2 assume !!(main_~i~0#1 < 100); 2773#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2772#L10-2 assume !!(main_~i~0#1 < 100); 2771#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2770#L10-2 assume !!(main_~i~0#1 < 100); 2769#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2768#L10-2 assume !!(main_~i~0#1 < 100); 2767#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2766#L10-2 assume !!(main_~i~0#1 < 100); 2765#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2764#L10-2 assume !!(main_~i~0#1 < 100); 2763#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2762#L10-2 assume !!(main_~i~0#1 < 100); 2761#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2760#L10-2 assume !!(main_~i~0#1 < 100); 2759#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2758#L10-2 assume !!(main_~i~0#1 < 100); 2757#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2756#L10-2 assume !!(main_~i~0#1 < 100); 2755#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2754#L10-2 assume !!(main_~i~0#1 < 100); 2753#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2752#L10-2 assume !!(main_~i~0#1 < 100); 2751#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2750#L10-2 assume !!(main_~i~0#1 < 100); 2749#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2748#L10-2 assume !!(main_~i~0#1 < 100); 2747#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2746#L10-2 assume !!(main_~i~0#1 < 100); 2745#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2744#L10-2 assume !!(main_~i~0#1 < 100); 2743#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2742#L10-2 assume !!(main_~i~0#1 < 100); 2741#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2740#L10-2 assume !!(main_~i~0#1 < 100); 2739#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2738#L10-2 assume !!(main_~i~0#1 < 100); 2737#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2736#L10-2 assume !!(main_~i~0#1 < 100); 2735#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2734#L10-2 assume !!(main_~i~0#1 < 100); 2733#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2732#L10-2 assume !!(main_~i~0#1 < 100); 2731#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2730#L10-2 assume !!(main_~i~0#1 < 100); 2729#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2728#L10-2 assume !!(main_~i~0#1 < 100); 2727#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2726#L10-2 assume !!(main_~i~0#1 < 100); 2725#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2724#L10-2 assume !!(main_~i~0#1 < 100); 2723#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2722#L10-2 assume !!(main_~i~0#1 < 100); 2721#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2720#L10-2 assume !!(main_~i~0#1 < 100); 2719#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2718#L10-2 assume !!(main_~i~0#1 < 100); 2717#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2716#L10-2 assume !!(main_~i~0#1 < 100); 2715#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2714#L10-2 assume !!(main_~i~0#1 < 100); 2713#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2712#L10-2 assume !!(main_~i~0#1 < 100); 2711#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2710#L10-2 assume !!(main_~i~0#1 < 100); 2709#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2708#L10-2 assume !!(main_~i~0#1 < 100); 2707#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2706#L10-2 assume !!(main_~i~0#1 < 100); 2705#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2704#L10-2 assume !!(main_~i~0#1 < 100); 2703#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2702#L10-2 assume !!(main_~i~0#1 < 100); 2701#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2700#L10-2 assume !!(main_~i~0#1 < 100); 2699#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2698#L10-2 assume !!(main_~i~0#1 < 100); 2697#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2696#L10-2 assume !!(main_~i~0#1 < 100); 2695#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2694#L10-2 assume !!(main_~i~0#1 < 100); 2693#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2692#L10-2 assume !!(main_~i~0#1 < 100); 2691#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2690#L10-2 assume !!(main_~i~0#1 < 100); 2689#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2688#L10-2 assume !!(main_~i~0#1 < 100); 2687#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2686#L10-2 assume !!(main_~i~0#1 < 100); 2685#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2684#L10-2 assume !!(main_~i~0#1 < 100); 2683#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2682#L10-2 assume !!(main_~i~0#1 < 100); 2681#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2680#L10-2 assume !!(main_~i~0#1 < 100); 2678#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2677#L10-2 assume !!(main_~i~0#1 < 100); 2679#L10 [2024-11-09 15:21:18,118 INFO L747 eck$LassoCheckResult]: Loop: 2679#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2680#L10-2 assume !!(main_~i~0#1 < 100); 2678#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2677#L10-2 assume !!(main_~i~0#1 < 100); 2679#L10 [2024-11-09 15:21:18,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1468745677, now seen corresponding path program 6 times [2024-11-09 15:21:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118350922] [2024-11-09 15:21:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:18,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:18,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:18,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:18,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2024-11-09 15:21:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:18,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618534394] [2024-11-09 15:21:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:18,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:18,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:18,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1914756667, now seen corresponding path program 7 times [2024-11-09 15:21:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:18,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830765768] [2024-11-09 15:21:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:18,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:18,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:18,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:19,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:19,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:21:19 BoogieIcfgContainer [2024-11-09 15:21:19,530 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:21:19,531 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:21:19,531 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:21:19,531 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:21:19,532 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:21:09" (3/4) ... [2024-11-09 15:21:19,533 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:21:19,592 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:21:19,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:21:19,593 INFO L158 Benchmark]: Toolchain (without parser) took 10793.87ms. Allocated memory was 146.8MB in the beginning and 237.0MB in the end (delta: 90.2MB). Free memory was 89.4MB in the beginning and 86.3MB in the end (delta: 3.1MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2024-11-09 15:21:19,593 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 146.8MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:21:19,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.28ms. Allocated memory is still 146.8MB. Free memory was 89.4MB in the beginning and 78.2MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:21:19,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.15ms. Allocated memory is still 146.8MB. Free memory was 78.2MB in the beginning and 77.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:21:19,593 INFO L158 Benchmark]: Boogie Preprocessor took 24.83ms. Allocated memory is still 146.8MB. Free memory was 77.0MB in the beginning and 75.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:21:19,594 INFO L158 Benchmark]: RCFGBuilder took 188.77ms. Allocated memory is still 146.8MB. Free memory was 75.4MB in the beginning and 67.0MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 15:21:19,594 INFO L158 Benchmark]: BuchiAutomizer took 10272.63ms. Allocated memory was 146.8MB in the beginning and 237.0MB in the end (delta: 90.2MB). Free memory was 67.0MB in the beginning and 90.5MB in the end (delta: -23.5MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-11-09 15:21:19,594 INFO L158 Benchmark]: Witness Printer took 61.17ms. Allocated memory is still 237.0MB. Free memory was 90.5MB in the beginning and 86.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:21:19,596 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.60ms. Allocated memory is still 146.8MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.28ms. Allocated memory is still 146.8MB. Free memory was 89.4MB in the beginning and 78.2MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.15ms. Allocated memory is still 146.8MB. Free memory was 78.2MB in the beginning and 77.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.83ms. Allocated memory is still 146.8MB. Free memory was 77.0MB in the beginning and 75.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 188.77ms. Allocated memory is still 146.8MB. Free memory was 75.4MB in the beginning and 67.0MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 10272.63ms. Allocated memory was 146.8MB in the beginning and 237.0MB in the end (delta: 90.2MB). Free memory was 67.0MB in the beginning and 90.5MB in the end (delta: -23.5MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. * Witness Printer took 61.17ms. Allocated memory is still 237.0MB. Free memory was 90.5MB in the beginning and 86.3MB 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 11 terminating modules (6 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 106 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.1s and 8 iterations. TraceHistogramMax:52. Analysis of lassos took 8.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 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 [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 352 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 51 mSDtfsCounter, 352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN2 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax203 hnf100 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 10]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] [L9] COND TRUE i < 100 VAL [i=50] [L10] COND FALSE !(i < 50) [L11] i = i-1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] Loop: [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] [L9] COND TRUE i < 100 VAL [i=50] [L10] COND FALSE !(i < 50) [L11] i = i-1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] Loop: [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:21:19,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-11-09 15:21:19,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-11-09 15:21:20,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-09 15:21:20,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:20,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:20,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)