./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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.3.0-?-e2fb8be-m [2025-03-09 06:49:52,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:49:52,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:49:52,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:49:52,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:49:52,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:49:53,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:49:53,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:49:53,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:49:53,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:49:53,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:49:53,003 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:49:53,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:49:53,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:49:53,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:49:53,004 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:49:53,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:49:53,004 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:49:53,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:49:53,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:49:53,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:49:53,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:49:53,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:49:53,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:49:53,004 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:49:53,004 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 [2025-03-09 06:49:53,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:49:53,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:49:53,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:49:53,236 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:49:53,236 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:49:53,237 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 [2025-03-09 06:49:54,324 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310e17e7a/d779ebbcd74c4f40994732ffe2a16356/FLAG9093ffd1a [2025-03-09 06:49:54,530 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:49:54,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2025-03-09 06:49:54,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310e17e7a/d779ebbcd74c4f40994732ffe2a16356/FLAG9093ffd1a [2025-03-09 06:49:54,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310e17e7a/d779ebbcd74c4f40994732ffe2a16356 [2025-03-09 06:49:54,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:49:54,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:49:54,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:54,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:49:54,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:49:54,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:54" (1/1) ... [2025-03-09 06:49:54,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c86681a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:54, skipping insertion in model container [2025-03-09 06:49:54,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:54" (1/1) ... [2025-03-09 06:49:54,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:49:55,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:55,020 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:49:55,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:55,037 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:49:55,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55 WrapperNode [2025-03-09 06:49:55,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:55,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:55,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:49:55,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:49:55,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,056 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 10 [2025-03-09 06:49:55,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:55,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:49:55,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:49:55,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:49:55,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,066 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 06:49:55,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:49:55,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:49:55,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:49:55,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:49:55,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (1/1) ... [2025-03-09 06:49:55,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,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) [2025-03-09 06:49:55,105 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 [2025-03-09 06:49:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:49:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:49:55,167 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:49:55,168 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:49:55,224 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-03-09 06:49:55,225 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:49:55,231 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:49:55,232 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:49:55,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:55 BoogieIcfgContainer [2025-03-09 06:49:55,233 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:49:55,234 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:49:55,234 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:49:55,238 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:49:55,238 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:55,239 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:49:54" (1/3) ... [2025-03-09 06:49:55,240 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a72556e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:55, skipping insertion in model container [2025-03-09 06:49:55,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:55,240 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:55" (2/3) ... [2025-03-09 06:49:55,241 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a72556e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:55, skipping insertion in model container [2025-03-09 06:49:55,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:55,242 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:55" (3/3) ... [2025-03-09 06:49:55,243 INFO L363 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2025-03-09 06:49:55,286 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:49:55,286 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:49:55,287 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:49:55,287 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:49:55,287 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:49:55,287 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:49:55,287 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:49:55,287 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:49:55,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2025-03-09 06:49:55,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:49:55,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:55,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:55,305 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:55,306 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:55,306 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:49:55,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2025-03-09 06:49:55,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:49:55,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:55,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:55,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:49:55,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:55,313 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" [2025-03-09 06:49:55,314 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-09 06:49:55,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times [2025-03-09 06:49:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:55,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822893733] [2025-03-09 06:49:55,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:55,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:55,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:55,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:55,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:55,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:55,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:55,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:55,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:55,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 1 times [2025-03-09 06:49:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:55,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454490605] [2025-03-09 06:49:55,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:55,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:55,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:55,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:55,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:55,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:55,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:55,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:55,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:55,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:55,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:55,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1137982, now seen corresponding path program 1 times [2025-03-09 06:49:55,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:55,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012966546] [2025-03-09 06:49:55,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:55,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:55,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:55,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:55,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:55,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:55,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:55,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:55,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:55,502 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:55,503 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:55,503 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:55,504 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:55,504 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:55,504 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,505 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:55,505 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:55,505 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2025-03-09 06:49:55,505 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:55,505 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:55,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:55,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:55,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:55,579 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:55,580 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:55,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,583 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) [2025-03-09 06:49:55,584 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 [2025-03-09 06:49:55,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:55,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:55,605 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:55,605 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: [] [2025-03-09 06:49:55,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:55,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,613 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) [2025-03-09 06:49:55,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:55,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:55,617 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 [2025-03-09 06:49:55,635 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:55,635 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: [] [2025-03-09 06:49:55,640 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 [2025-03-09 06:49:55,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,643 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) [2025-03-09 06:49:55,645 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 [2025-03-09 06:49:55,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:55,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:55,665 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 [2025-03-09 06:49:55,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,667 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) [2025-03-09 06:49:55,668 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 [2025-03-09 06:49:55,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:55,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:55,693 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:55,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:49:55,697 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:55,697 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:55,697 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:55,698 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:55,698 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:55,698 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,698 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:55,698 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:55,698 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2025-03-09 06:49:55,698 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:55,698 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:55,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:55,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:55,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:55,746 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:55,748 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:55,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,752 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) [2025-03-09 06:49:55,754 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 [2025-03-09 06:49:55,756 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 [2025-03-09 06:49:55,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:55,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:55,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:55,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:55,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:55,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:55,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:55,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:55,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,784 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) [2025-03-09 06:49:55,786 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 [2025-03-09 06:49:55,787 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 [2025-03-09 06:49:55,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:55,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:55,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:55,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:55,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:55,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:55,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:55,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:55,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,811 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) [2025-03-09 06:49:55,813 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 [2025-03-09 06:49:55,814 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 [2025-03-09 06:49:55,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:55,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:55,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:55,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:55,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:55,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:55,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:55,828 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:55,831 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:55,833 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:55,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:55,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:55,836 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) [2025-03-09 06:49:55,838 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 [2025-03-09 06:49:55,839 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:55,839 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:55,839 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:55,839 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 [] [2025-03-09 06:49:55,844 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 [2025-03-09 06:49:55,847 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:55,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:55,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:55,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:55,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:55,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:55,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:55,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:55,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:55,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:55,885 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:55,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:55,910 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 [2025-03-09 06:49:55,911 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) 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) [2025-03-09 06:49:55,941 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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). 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 12 states and 17 transitions. Complement of second has 5 states. [2025-03-09 06:49:55,943 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 [2025-03-09 06:49:55,946 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) [2025-03-09 06:49:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-03-09 06:49:55,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-09 06:49:55,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:55,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-09 06:49:55,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:55,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-09 06:49:55,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:55,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-03-09 06:49:55,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:49:55,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 11 transitions. [2025-03-09 06:49:55,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-09 06:49:55,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-09 06:49:55,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-03-09 06:49:55,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:55,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-09 06:49:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-03-09 06:49:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-09 06:49:55,970 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) [2025-03-09 06:49:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-03-09 06:49:55,971 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-09 06:49:55,971 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-09 06:49:55,971 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:49:55,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-03-09 06:49:55,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:49:55,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:55,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:55,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:49:55,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:55,972 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume main_~i~0#1 < 100;" "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-09 06:49:55,972 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-09 06:49:55,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1137983, now seen corresponding path program 1 times [2025-03-09 06:49:55,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:55,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728941823] [2025-03-09 06:49:55,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:55,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:55,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:55,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:55,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:55,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:56,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:56,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728941823] [2025-03-09 06:49:56,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728941823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:56,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:56,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:49:56,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368123731] [2025-03-09 06:49:56,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:56,015 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:56,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:56,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 2 times [2025-03-09 06:49:56,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:56,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353874716] [2025-03-09 06:49:56,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:56,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:56,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:56,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:56,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:56,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:56,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:56,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:56,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:56,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:56,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:56,053 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:56,053 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:56,053 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:56,054 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:56,054 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:56,054 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,054 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:56,054 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:56,054 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2025-03-09 06:49:56,054 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:56,054 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:56,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,103 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:56,103 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:56,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,105 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:56,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:49:56,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:56,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:56,130 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:56,130 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: [] [2025-03-09 06:49:56,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:56,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,138 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) [2025-03-09 06:49:56,160 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 [2025-03-09 06:49:56,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:56,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:56,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-09 06:49:56,183 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:56,183 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:56,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:56,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,191 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) [2025-03-09 06:49:56,192 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 [2025-03-09 06:49:56,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:56,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:56,209 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 [2025-03-09 06:49:56,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,211 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) [2025-03-09 06:49:56,211 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 [2025-03-09 06:49:56,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:56,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:56,235 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:56,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:49:56,239 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:56,239 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:56,239 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:56,239 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:56,240 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:56,240 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,240 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:56,240 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:56,240 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2025-03-09 06:49:56,240 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:56,240 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:56,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,287 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:56,287 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:56,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,290 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) [2025-03-09 06:49:56,291 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 [2025-03-09 06:49:56,293 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 [2025-03-09 06:49:56,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:56,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:56,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:56,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:56,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:56,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:56,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:56,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:56,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,320 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) [2025-03-09 06:49:56,321 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 [2025-03-09 06:49:56,323 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 [2025-03-09 06:49:56,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:56,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:56,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:56,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:56,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:56,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:56,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:56,345 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 [2025-03-09 06:49:56,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,347 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) [2025-03-09 06:49:56,349 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 [2025-03-09 06:49:56,350 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 [2025-03-09 06:49:56,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:56,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:56,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:56,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:56,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:56,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:56,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:56,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:56,367 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:56,367 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:56,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,369 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:56,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 06:49:56,372 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:56,372 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:56,372 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:56,372 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 [] [2025-03-09 06:49:56,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:56,380 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:56,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:56,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:56,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:56,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:56,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:56,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:56,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:56,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:56,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:56,420 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 [2025-03-09 06:49:56,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 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) [2025-03-09 06:49:56,431 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. 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 12 states and 17 transitions. Complement of second has 5 states. [2025-03-09 06:49:56,432 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 [2025-03-09 06:49:56,432 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) [2025-03-09 06:49:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-09 06:49:56,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-09 06:49:56,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:56,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-09 06:49:56,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:56,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-09 06:49:56,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:56,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-03-09 06:49:56,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:49:56,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-03-09 06:49:56,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-09 06:49:56,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:49:56,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-03-09 06:49:56,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:56,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-09 06:49:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-03-09 06:49:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-09 06:49:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-03-09 06:49:56,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-09 06:49:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:56,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:49:56,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:49:56,437 INFO L87 Difference]: Start difference. First operand 12 states and 17 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) [2025-03-09 06:49:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:56,445 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-03-09 06:49:56,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-03-09 06:49:56,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:49:56,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 17 transitions. [2025-03-09 06:49:56,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:49:56,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:49:56,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-03-09 06:49:56,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:56,446 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-09 06:49:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-03-09 06:49:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-09 06:49:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-03-09 06:49:56,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-09 06:49:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:49:56,448 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-09 06:49:56,448 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:49:56,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-03-09 06:49:56,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:49:56,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:56,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:56,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2025-03-09 06:49:56,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:56,449 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-09 06:49:56,449 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-09 06:49:56,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1316559940, now seen corresponding path program 1 times [2025-03-09 06:49:56,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:56,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933915540] [2025-03-09 06:49:56,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:56,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:56,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:56,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:56,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:56,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:56,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933915540] [2025-03-09 06:49:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933915540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:56,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702259154] [2025-03-09 06:49:56,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:56,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,499 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:56,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 06:49:56,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:56,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:56,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:49:56,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:56,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:56,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702259154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:56,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:56,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-09 06:49:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058113406] [2025-03-09 06:49:56,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:56,570 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:49:56,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 3 times [2025-03-09 06:49:56,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:56,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007692220] [2025-03-09 06:49:56,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:56,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:56,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:56,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:56,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:49:56,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:56,575 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:56,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:56,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:56,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:56,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:56,596 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:56,596 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:56,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:56,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:56,596 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:56,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:56,596 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:56,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2025-03-09 06:49:56,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:56,596 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:56,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,631 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:56,632 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:56,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,653 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) [2025-03-09 06:49:56,655 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 [2025-03-09 06:49:56,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:56,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:56,672 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 [2025-03-09 06:49:56,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,674 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) [2025-03-09 06:49:56,674 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 [2025-03-09 06:49:56,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:56,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:56,697 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:56,702 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 [2025-03-09 06:49:56,702 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:56,702 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:56,702 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:56,703 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:56,703 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:56,703 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,703 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:56,703 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:56,703 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2025-03-09 06:49:56,703 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:56,703 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:56,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:56,741 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:56,741 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:56,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,743 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) [2025-03-09 06:49:56,745 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 [2025-03-09 06:49:56,746 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 [2025-03-09 06:49:56,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:56,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:56,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:56,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:56,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:56,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:56,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:56,758 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:56,760 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:56,760 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:49:56,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:56,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:56,762 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) [2025-03-09 06:49:56,763 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 [2025-03-09 06:49:56,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:56,763 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:56,763 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:56,764 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 [] [2025-03-09 06:49:56,769 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 [2025-03-09 06:49:56,770 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:56,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:56,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:56,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:56,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:56,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:56,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:56,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:56,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,797 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:56,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:56,799 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 [2025-03-09 06:49:56,800 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 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) [2025-03-09 06:49:56,810 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. 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 14 states and 20 transitions. Complement of second has 5 states. [2025-03-09 06:49:56,810 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 [2025-03-09 06:49:56,811 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) [2025-03-09 06:49:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-09 06:49:56,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-09 06:49:56,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:56,811 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:56,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:56,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:56,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:56,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:56,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:56,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:56,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:56,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,842 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:56,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:56,845 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 [2025-03-09 06:49:56,845 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 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) [2025-03-09 06:49:56,851 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. 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 14 states and 20 transitions. Complement of second has 5 states. [2025-03-09 06:49:56,851 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 [2025-03-09 06:49:56,851 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) [2025-03-09 06:49:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-09 06:49:56,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-09 06:49:56,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:56,852 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:56,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:56,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:56,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:56,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:56,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:56,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:56,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:56,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:56,876 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:56,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:56,879 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 [2025-03-09 06:49:56,879 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 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) [2025-03-09 06:49:56,886 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. 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 16 states and 23 transitions. Complement of second has 4 states. [2025-03-09 06:49:56,886 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 [2025-03-09 06:49:56,887 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) [2025-03-09 06:49:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-09 06:49:56,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-09 06:49:56,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:56,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-09 06:49:56,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:56,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-09 06:49:56,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:56,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2025-03-09 06:49:56,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:49:56,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2025-03-09 06:49:56,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-09 06:49:56,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:49:56,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2025-03-09 06:49:56,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:56,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-03-09 06:49:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2025-03-09 06:49:56,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 7. [2025-03-09 06:49:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2025-03-09 06:49:56,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-03-09 06:49:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:56,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:49:56,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:49:56,890 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) [2025-03-09 06:49:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:56,904 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2025-03-09 06:49:56,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2025-03-09 06:49:56,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:49:56,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2025-03-09 06:49:56,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-09 06:49:56,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-09 06:49:56,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2025-03-09 06:49:56,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:56,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-09 06:49:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2025-03-09 06:49:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-09 06:49:56,906 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) [2025-03-09 06:49:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-09 06:49:56,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-09 06:49:56,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:49:56,906 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-09 06:49:56,907 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:49:56,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2025-03-09 06:49:56,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:49:56,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:56,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:56,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1] [2025-03-09 06:49:56,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:49:56,907 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-03-09 06:49:56,907 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" [2025-03-09 06:49:56,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash -24479507, now seen corresponding path program 2 times [2025-03-09 06:49:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929271292] [2025-03-09 06:49:56,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:56,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 06:49:56,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:49:56,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:56,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:56,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:56,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:49:56,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:49:56,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:56,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:56,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:56,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1090, now seen corresponding path program 1 times [2025-03-09 06:49:56,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:56,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347001245] [2025-03-09 06:49:56,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:56,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:56,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:56,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:56,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:56,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:56,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:56,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:56,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:56,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:56,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:56,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2049969618, now seen corresponding path program 2 times [2025-03-09 06:49:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:56,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010654283] [2025-03-09 06:49:56,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:56,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:56,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 06:49:56,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:49:56,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:56,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:57,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010654283] [2025-03-09 06:49:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010654283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:57,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519402122] [2025-03-09 06:49:57,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:57,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:57,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:57,020 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:57,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 06:49:57,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 06:49:57,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:49:57,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:57,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:57,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:49:57,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:57,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:57,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519402122] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:57,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:57,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-09 06:49:57,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380394922] [2025-03-09 06:49:57,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:57,153 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:57,153 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:57,153 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:57,153 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:57,154 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:49:57,154 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:57,154 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:57,154 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:57,154 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2025-03-09 06:49:57,154 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:57,154 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:57,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:57,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:57,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:57,187 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:57,187 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:49:57,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:57,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:57,189 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) [2025-03-09 06:49:57,191 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 [2025-03-09 06:49:57,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:57,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:57,210 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:57,210 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: [] [2025-03-09 06:49:57,215 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 [2025-03-09 06:49:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:57,217 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) [2025-03-09 06:49:57,219 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 [2025-03-09 06:49:57,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:57,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:57,237 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:49:57,237 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 06:49:57,243 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 [2025-03-09 06:49:57,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:57,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:57,245 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) [2025-03-09 06:49:57,246 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 [2025-03-09 06:49:57,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:49:57,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:57,263 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 [2025-03-09 06:49:57,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:57,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:57,265 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:57,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 06:49:57,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:49:57,266 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:49:57,289 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:49:57,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 06:49:57,293 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:57,293 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:57,293 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:57,293 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:57,293 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:57,293 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:57,293 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:57,293 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:57,293 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2025-03-09 06:49:57,293 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:57,293 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:57,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:57,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:57,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:57,329 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:57,329 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:57,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:57,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:57,331 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) [2025-03-09 06:49:57,332 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 [2025-03-09 06:49:57,333 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 [2025-03-09 06:49:57,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:57,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:57,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:57,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:57,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:57,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:57,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:57,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 06:49:57,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:57,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:57,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:57,370 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) [2025-03-09 06:49:57,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:57,370 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 [2025-03-09 06:49:57,371 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 [2025-03-09 06:49:57,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:57,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:57,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:57,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:57,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:57,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:57,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:57,391 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 [2025-03-09 06:49:57,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:57,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:57,393 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) [2025-03-09 06:49:57,393 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 [2025-03-09 06:49:57,394 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 [2025-03-09 06:49:57,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:57,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:57,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:57,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:57,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:57,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:57,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:57,406 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:57,408 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:49:57,408 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:49:57,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:57,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:57,410 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) [2025-03-09 06:49:57,411 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 [2025-03-09 06:49:57,411 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:57,411 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:49:57,411 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:57,411 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 [] [2025-03-09 06:49:57,417 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 [2025-03-09 06:49:57,418 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:49:57,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:57,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:49:57,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:49:57,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:57,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:57,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:57,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:57,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:57,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:57,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:57,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:57,461 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:57,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:57,472 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 [2025-03-09 06:49:57,473 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 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) [2025-03-09 06:49:57,475 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 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 13 states and 15 transitions. Complement of second has 3 states. [2025-03-09 06:49:57,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:57,476 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) [2025-03-09 06:49:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-09 06:49:57,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-09 06:49:57,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:57,476 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:57,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:57,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:49:57,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:49:57,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:57,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:57,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:57,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:57,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:57,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:57,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:57,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:57,509 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:57,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:57,521 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 [2025-03-09 06:49:57,521 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 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) [2025-03-09 06:49:57,525 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 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 13 states and 15 transitions. Complement of second has 3 states. [2025-03-09 06:49:57,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:57,526 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) [2025-03-09 06:49:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-09 06:49:57,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-09 06:49:57,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:57,527 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:57,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:57,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:49:57,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:49:57,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:57,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:57,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:57,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:57,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:49:57,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:49:57,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:57,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:57,556 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:57,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:57,567 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 [2025-03-09 06:49:57,568 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 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) [2025-03-09 06:49:57,573 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 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 17 states and 19 transitions. Complement of second has 4 states. [2025-03-09 06:49:57,573 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 [2025-03-09 06:49:57,574 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) [2025-03-09 06:49:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-09 06:49:57,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-09 06:49:57,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:57,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-09 06:49:57,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:57,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-09 06:49:57,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:57,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2025-03-09 06:49:57,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:49:57,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 17 transitions. [2025-03-09 06:49:57,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-09 06:49:57,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-09 06:49:57,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2025-03-09 06:49:57,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:57,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-09 06:49:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2025-03-09 06:49:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-09 06:49:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-03-09 06:49:57,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-09 06:49:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:57,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:49:57,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:49:57,577 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:57,601 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-03-09 06:49:57,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2025-03-09 06:49:57,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:49:57,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 29 transitions. [2025-03-09 06:49:57,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-09 06:49:57,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-09 06:49:57,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2025-03-09 06:49:57,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:57,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-03-09 06:49:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2025-03-09 06:49:57,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-03-09 06:49:57,603 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) [2025-03-09 06:49:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-09 06:49:57,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-09 06:49:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 06:49:57,605 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-09 06:49:57,605 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:49:57,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2025-03-09 06:49:57,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:49:57,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:57,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:57,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1] [2025-03-09 06:49:57,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-03-09 06:49:57,605 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-03-09 06:49:57,605 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-03-09 06:49:57,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1054111687, now seen corresponding path program 3 times [2025-03-09 06:49:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:57,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704856542] [2025-03-09 06:49:57,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:57,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 11 equivalence classes. [2025-03-09 06:49:57,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:49:57,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 06:49:57,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:57,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:57,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:49:57,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:49:57,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:57,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:57,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:57,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:57,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1047588, now seen corresponding path program 1 times [2025-03-09 06:49:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384130281] [2025-03-09 06:49:57,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:57,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:57,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:57,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:57,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:57,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:57,624 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:57,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:57,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:57,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:57,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:57,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:57,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1286821796, now seen corresponding path program 3 times [2025-03-09 06:49:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:57,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484762501] [2025-03-09 06:49:57,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:57,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:57,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 13 equivalence classes. [2025-03-09 06:49:57,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:49:57,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-09 06:49:57,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:49:57,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484762501] [2025-03-09 06:49:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484762501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294056816] [2025-03-09 06:49:57,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:57,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:57,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:57,779 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:57,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-09 06:49:57,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 13 equivalence classes. [2025-03-09 06:49:57,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:49:57,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-09 06:49:57,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:57,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:49:57,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:49:57,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:49:58,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294056816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:58,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:58,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-03-09 06:49:58,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121910179] [2025-03-09 06:49:58,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:58,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 06:49:58,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-09 06:49:58,079 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 3 Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:58,131 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2025-03-09 06:49:58,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2025-03-09 06:49:58,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:49:58,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2025-03-09 06:49:58,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-09 06:49:58,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-09 06:49:58,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2025-03-09 06:49:58,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:58,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-03-09 06:49:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2025-03-09 06:49:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-03-09 06:49:58,134 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) [2025-03-09 06:49:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-03-09 06:49:58,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-03-09 06:49:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:49:58,138 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-03-09 06:49:58,138 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:49:58,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2025-03-09 06:49:58,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:49:58,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:58,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:58,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 1, 1] [2025-03-09 06:49:58,139 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-03-09 06:49:58,139 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-03-09 06:49:58,139 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-03-09 06:49:58,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1494151377, now seen corresponding path program 4 times [2025-03-09 06:49:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319084256] [2025-03-09 06:49:58,139 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:58,143 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-09 06:49:58,159 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:49:58,159 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:58,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:58,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:58,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:49:58,167 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 [2025-03-09 06:49:58,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:49:58,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:58,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:58,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:58,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1047588, now seen corresponding path program 2 times [2025-03-09 06:49:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:58,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544900057] [2025-03-09 06:49:58,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:58,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:58,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-03-09 06:49:58,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:58,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:58,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:58,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:58,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:58,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:58,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:58,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:58,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:58,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1671038196, now seen corresponding path program 4 times [2025-03-09 06:49:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:58,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631692912] [2025-03-09 06:49:58,184 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:58,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:58,187 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-09 06:49:58,196 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 06:49:58,196 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:58,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:49:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631692912] [2025-03-09 06:49:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631692912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745199443] [2025-03-09 06:49:58,563 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:49:58,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:58,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:58,564 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:58,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-09 06:49:58,585 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-09 06:49:58,595 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 06:49:58,595 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:49:58,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:58,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 06:49:58,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:49:58,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:49:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745199443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:59,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:59,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2025-03-09 06:49:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888048478] [2025-03-09 06:49:59,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:59,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:59,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-09 06:49:59,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 06:49:59,362 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.0208333333333335) internal successors, (97), 48 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:59,490 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2025-03-09 06:49:59,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2025-03-09 06:49:59,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:49:59,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2025-03-09 06:49:59,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-09 06:49:59,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-09 06:49:59,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2025-03-09 06:49:59,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:59,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2025-03-09 06:49:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2025-03-09 06:49:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-03-09 06:49:59,499 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) [2025-03-09 06:49:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2025-03-09 06:49:59,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-03-09 06:49:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 06:49:59,502 INFO L432 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-03-09 06:49:59,502 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:49:59,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2025-03-09 06:49:59,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:49:59,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:59,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:59,507 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 1, 1] [2025-03-09 06:49:59,507 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-03-09 06:49:59,507 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-03-09 06:49:59,508 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-03-09 06:49:59,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 437185025, now seen corresponding path program 5 times [2025-03-09 06:49:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:59,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829792260] [2025-03-09 06:49:59,509 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:59,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:59,518 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 95 statements into 47 equivalence classes. [2025-03-09 06:49:59,578 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 06:49:59,578 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 06:49:59,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:59,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:59,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 06:49:59,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 06:49:59,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:59,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:59,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:59,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:59,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1047588, now seen corresponding path program 3 times [2025-03-09 06:49:59,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:59,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786393813] [2025-03-09 06:49:59,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:59,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:59,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 2 equivalence classes. [2025-03-09 06:49:59,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:59,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:49:59,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:59,599 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:59,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:49:59,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:49:59,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:59,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:59,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:59,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1150936612, now seen corresponding path program 5 times [2025-03-09 06:49:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:59,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104221103] [2025-03-09 06:49:59,601 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:49:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:59,606 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 49 equivalence classes. [2025-03-09 06:49:59,628 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 06:49:59,628 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-03-09 06:49:59,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:50:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:50:00,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104221103] [2025-03-09 06:50:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104221103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:50:00,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229945180] [2025-03-09 06:50:00,879 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:50:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:50:00,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:50:00,881 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:50:00,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-09 06:50:00,902 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 99 statements into 49 equivalence classes. [2025-03-09 06:50:00,932 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 06:50:00,932 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-03-09 06:50:00,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:50:00,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-09 06:50:00,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:50:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:50:01,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:50:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:50:02,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229945180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:50:02,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:50:02,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2025-03-09 06:50:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893070235] [2025-03-09 06:50:02,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:50:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:50:02,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-09 06:50:02,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-03-09 06:50:02,124 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.0384615384615383) internal successors, (106), 52 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:50:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:50:02,236 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2025-03-09 06:50:02,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 113 transitions. [2025-03-09 06:50:02,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:50:02,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 109 transitions. [2025-03-09 06:50:02,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-09 06:50:02,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-09 06:50:02,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 109 transitions. [2025-03-09 06:50:02,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:50:02,238 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2025-03-09 06:50:02,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 109 transitions. [2025-03-09 06:50:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-03-09 06:50:02,243 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) [2025-03-09 06:50:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2025-03-09 06:50:02,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 108 transitions. [2025-03-09 06:50:02,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-09 06:50:02,244 INFO L432 stractBuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2025-03-09 06:50:02,244 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:50:02,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2025-03-09 06:50:02,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:50:02,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:50:02,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:50:02,247 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [51, 50, 1, 1] [2025-03-09 06:50:02,247 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-03-09 06:50:02,247 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "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;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-03-09 06:50:02,247 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-03-09 06:50:02,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:02,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1823311991, now seen corresponding path program 6 times [2025-03-09 06:50:02,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:02,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376908958] [2025-03-09 06:50:02,248 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:50:02,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:02,252 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 103 statements into 51 equivalence classes. [2025-03-09 06:50:02,261 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 06:50:02,262 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2025-03-09 06:50:02,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:02,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:02,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 06:50:02,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 06:50:02,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:02,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:02,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:02,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:02,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1047588, now seen corresponding path program 4 times [2025-03-09 06:50:02,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:02,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053370601] [2025-03-09 06:50:02,273 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:50:02,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:02,274 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-03-09 06:50:02,274 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:50:02,274 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:50:02,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:02,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:02,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:50:02,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:50:02,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:02,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:02,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:02,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:50:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash 785084332, now seen corresponding path program 6 times [2025-03-09 06:50:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:50:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870087346] [2025-03-09 06:50:02,276 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:50:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:50:02,280 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 107 statements into 53 equivalence classes. [2025-03-09 06:50:02,290 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 06:50:02,292 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) [2025-03-09 06:50:02,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:02,292 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:02,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 06:50:02,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 06:50:02,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:02,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:02,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:50:03,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 06:50:03,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 06:50:03,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:03,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:03,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:50:03,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 06:50:03,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 06:50:03,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:50:03,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:50:03,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:50:03 BoogieIcfgContainer [2025-03-09 06:50:03,309 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:50:03,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:50:03,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:50:03,309 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:50:03,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:55" (3/4) ... [2025-03-09 06:50:03,313 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 06:50:03,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:50:03,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:50:03,357 INFO L158 Benchmark]: Toolchain (without parser) took 8462.34ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 112.3MB in the beginning and 128.1MB in the end (delta: -15.8MB). Peak memory consumption was 156.6MB. Max. memory is 16.1GB. [2025-03-09 06:50:03,357 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:50:03,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.09ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:50:03,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.62ms. Allocated memory is still 142.6MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:50:03,358 INFO L158 Benchmark]: Boogie Preprocessor took 13.69ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:50:03,358 INFO L158 Benchmark]: IcfgBuilder took 161.00ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 90.7MB in the end (delta: 9.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:50:03,358 INFO L158 Benchmark]: BuchiAutomizer took 8075.21ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 90.7MB in the beginning and 133.0MB in the end (delta: -42.3MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. [2025-03-09 06:50:03,358 INFO L158 Benchmark]: Witness Printer took 47.16ms. Allocated memory is still 318.8MB. Free memory was 133.0MB in the beginning and 128.1MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:50:03,359 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.14ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.09ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.62ms. Allocated memory is still 142.6MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.69ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 161.00ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 90.7MB in the end (delta: 9.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 8075.21ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 90.7MB in the beginning and 133.0MB in the end (delta: -42.3MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. * Witness Printer took 47.16ms. Allocated memory is still 318.8MB. Free memory was 133.0MB in the beginning and 128.1MB in the end (delta: 4.9MB). There was no memory consumed. 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 10 terminating modules (6 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 99) 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 (((long) -2 * i) + 99) and consists of 3 locations. One nondeterministic module has affine ranking function i 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 7.9s and 8 iterations. TraceHistogramMax:51. Analysis of lassos took 7.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 8 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 [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 333 IncrementalHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 51 mSDtfsCounter, 333 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc3 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax213 hnf100 lsp47 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s 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] Loop: [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] 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] Loop: [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-09 06:50:03,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-03-09 06:50:03,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:03,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-09 06:50:03,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:04,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 06:50:04,373 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)