./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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-crafted/McCarthy91_Iteration.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 7a5d554c80523420ffafe318e54a94b7662019572fad78d6e8fce2ccc83674b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:33:51,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:33:51,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:33:51,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:33:51,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:33:51,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:33:51,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:33:51,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:33:51,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:33:51,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:33:51,874 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:33:51,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:33:51,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:33:51,874 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:33:51,874 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:33:51,874 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:33:51,874 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:33:51,875 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:33:51,875 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:33:51,875 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:33:51,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:33:51,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:33:51,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:33:51,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:33:51,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:33:51,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:33:51,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:33:51,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:33:51,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:33:51,876 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:33:51,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:33:51,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:33:51,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:33:51,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:33:51,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:33:51,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:33:51,876 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:33:51,876 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 -> 7a5d554c80523420ffafe318e54a94b7662019572fad78d6e8fce2ccc83674b0 [2025-03-04 15:33:52,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:33:52,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:33:52,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:33:52,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:33:52,115 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:33:52,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2025-03-04 15:33:53,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1230f3b54/6c1038d911504c348e6776c2400bc310/FLAG41c759e4e [2025-03-04 15:33:53,462 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:33:53,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2025-03-04 15:33:53,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1230f3b54/6c1038d911504c348e6776c2400bc310/FLAG41c759e4e [2025-03-04 15:33:53,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1230f3b54/6c1038d911504c348e6776c2400bc310 [2025-03-04 15:33:53,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:33:53,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:33:53,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:33:53,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:33:53,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:33:53,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbdc19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53, skipping insertion in model container [2025-03-04 15:33:53,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:33:53,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:33:53,936 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:33:53,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:33:53,954 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:33:53,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53 WrapperNode [2025-03-04 15:33:53,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:33:53,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:33:53,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:33:53,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:33:53,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,971 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 16 [2025-03-04 15:33:53,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:33:53,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:33:53,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:33:53,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:33:53,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,984 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:33:53,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:33:53,991 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:33:53,991 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:33:53,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:33:53,993 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (1/1) ... [2025-03-04 15:33:53,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:54,028 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-04 15:33:54,032 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-04 15:33:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:33:54,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:33:54,092 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:33:54,094 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:33:54,138 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-03-04 15:33:54,138 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:33:54,144 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:33:54,144 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:33:54,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:54 BoogieIcfgContainer [2025-03-04 15:33:54,145 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:33:54,145 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:33:54,145 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:33:54,150 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:33:54,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:54,150 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:33:53" (1/3) ... [2025-03-04 15:33:54,151 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5400eecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:33:54, skipping insertion in model container [2025-03-04 15:33:54,151 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:54,152 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:53" (2/3) ... [2025-03-04 15:33:54,152 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5400eecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:33:54, skipping insertion in model container [2025-03-04 15:33:54,152 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:54,152 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:54" (3/3) ... [2025-03-04 15:33:54,153 INFO L363 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration.c [2025-03-04 15:33:54,188 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:33:54,189 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:33:54,189 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:33:54,189 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:33:54,189 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:33:54,189 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:33:54,189 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:33:54,189 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:33:54,192 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-04 15:33:54,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:33:54,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:54,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:54,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:33:54,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:33:54,203 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:33:54,203 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-04 15:33:54,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:33:54,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:54,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:54,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:33:54,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:33:54,207 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-03-04 15:33:54,208 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" [2025-03-04 15:33:54,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times [2025-03-04 15:33:54,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:54,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087052922] [2025-03-04 15:33:54,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:54,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:54,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:54,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:54,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:54,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:54,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:54,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:54,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 1 times [2025-03-04 15:33:54,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:54,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128060958] [2025-03-04 15:33:54,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:54,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:54,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:54,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:54,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:54,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:54,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:54,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:54,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:54,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1137982, now seen corresponding path program 1 times [2025-03-04 15:33:54,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:54,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905732062] [2025-03-04 15:33:54,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:54,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:54,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:54,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:54,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:54,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:54,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:54,356 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:54,357 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:54,357 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:54,357 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:54,357 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:54,357 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,357 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:54,357 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:54,358 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2025-03-04 15:33:54,358 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:54,358 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:54,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,447 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:54,448 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:54,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:54,450 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-04 15:33:54,451 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-04 15:33:54,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:54,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:54,472 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:54,472 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-04 15:33:54,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:33:54,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:54,480 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-04 15:33:54,482 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-04 15:33:54,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:54,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:54,501 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:54,501 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-04 15:33:54,506 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-04 15:33:54,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:54,508 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-04 15:33:54,510 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-04 15:33:54,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:54,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:54,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:54,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:54,529 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-04 15:33:54,530 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-04 15:33:54,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:54,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:54,554 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:54,558 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-04 15:33:54,558 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:54,558 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:54,558 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:54,558 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:54,558 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:54,558 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,558 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:54,558 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:54,558 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2025-03-04 15:33:54,558 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:54,558 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:54,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,618 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:54,620 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:54,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:54,623 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-04 15:33:54,625 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-04 15:33:54,626 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-04 15:33:54,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:54,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:54,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:54,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:54,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:54,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:54,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:54,655 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-04 15:33:54,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:54,658 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-04 15:33:54,659 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-04 15:33:54,661 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-04 15:33:54,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:54,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:54,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:54,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:54,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:54,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:54,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:54,684 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-04 15:33:54,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:54,686 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-04 15:33:54,687 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-04 15:33:54,689 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-04 15:33:54,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:54,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:54,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:54,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:54,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:54,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:54,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:54,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:54,705 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:33:54,707 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:33:54,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:54,710 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-04 15:33:54,711 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-04 15:33:54,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:54,712 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:54,712 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:54,712 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2025-03-04 15:33:54,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 15:33:54,719 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:54,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:54,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:54,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:54,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:54,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:54,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:54,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:54,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:54,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:54,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:33:54,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:54,773 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-04 15:33:54,796 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-04 15:33:54,797 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-04 15:33:54,829 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-04 15:33:54,831 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-04 15:33:54,835 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-04 15:33:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-03-04 15:33:54,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 15:33:54,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:54,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:33:54,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:54,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-04 15:33:54,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:54,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-03-04 15:33:54,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:33:54,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 11 transitions. [2025-03-04 15:33:54,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 15:33:54,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-04 15:33:54,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-03-04 15:33:54,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:54,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-04 15:33:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-03-04 15:33:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-04 15:33:54,862 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-04 15:33:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-03-04 15:33:54,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-04 15:33:54,864 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-04 15:33:54,864 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:33:54,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-03-04 15:33:54,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:33:54,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:54,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:54,865 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:33:54,865 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:33:54,865 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-03-04 15:33:54,865 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" [2025-03-04 15:33:54,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1137983, now seen corresponding path program 1 times [2025-03-04 15:33:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:54,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066693731] [2025-03-04 15:33:54,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:54,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:54,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:54,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:54,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:54,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:54,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:54,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 2 times [2025-03-04 15:33:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260411009] [2025-03-04 15:33:54,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:54,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:54,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:54,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:33:54,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:54,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:54,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:54,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:54,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:54,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1093601821, now seen corresponding path program 1 times [2025-03-04 15:33:54,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:54,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693699519] [2025-03-04 15:33:54,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:54,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:54,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:54,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:54,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:54,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:54,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:54,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:54,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:54,918 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-04 15:33:54,929 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:54,929 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:54,929 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:54,929 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:54,929 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:54,929 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,929 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:54,929 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:54,929 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2025-03-04 15:33:54,929 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:54,930 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:54,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:54,981 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:54,981 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:54,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:54,983 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-04 15:33:54,984 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-04 15:33:54,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:54,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,002 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:55,002 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-04 15:33:55,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 15:33:55,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,010 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-04 15:33:55,011 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-04 15:33:55,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:55,012 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,029 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:55,029 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-04 15:33:55,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:33:55,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,036 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-04 15:33:55,037 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-04 15:33:55,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:55,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,055 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-04 15:33:55,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,057 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-04 15:33:55,058 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-04 15:33:55,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:55,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,081 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:55,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:55,085 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:55,085 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:55,085 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:55,085 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:55,085 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:55,085 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,085 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:55,085 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:55,085 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2025-03-04 15:33:55,085 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:55,085 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:55,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,140 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:55,140 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:55,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,143 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-04 15:33:55,144 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-04 15:33:55,145 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-04 15:33:55,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:55,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:55,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:55,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:55,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:55,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:55,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:55,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 15:33:55,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,168 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-04 15:33:55,170 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-04 15:33:55,170 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-04 15:33:55,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:55,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:55,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:55,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:55,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:55,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:55,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:55,193 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-04 15:33:55,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,196 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-04 15:33:55,196 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-04 15:33:55,197 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-04 15:33:55,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:55,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:55,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:55,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:55,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:55,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:55,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:55,213 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:55,215 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:33:55,215 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:33:55,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,218 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-04 15:33:55,222 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-04 15:33:55,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:55,222 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:55,223 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:55,223 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2025-03-04 15:33:55,228 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-04 15:33:55,229 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:55,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:55,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:55,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:55,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:55,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:55,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:55,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:55,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:55,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:55,264 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:33:55,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:55,279 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-04 15:33:55,279 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-04 15:33:55,280 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-04 15:33:55,298 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-04 15:33:55,298 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-04 15:33:55,300 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-04 15:33:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 15:33:55,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:33:55,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:55,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:33:55,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:55,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-04 15:33:55,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:55,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-03-04 15:33:55,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:33:55,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-03-04 15:33:55,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-04 15:33:55,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:33:55,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-03-04 15:33:55,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:55,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-04 15:33:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-03-04 15:33:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 15:33:55,302 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-04 15:33:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-03-04 15:33:55,303 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-04 15:33:55,303 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-04 15:33:55,303 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:33:55,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-03-04 15:33:55,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:33:55,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:55,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:55,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-03-04 15:33:55,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:33:55,303 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-03-04 15:33:55,305 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" [2025-03-04 15:33:55,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1093601822, now seen corresponding path program 2 times [2025-03-04 15:33:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:55,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789276469] [2025-03-04 15:33:55,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:55,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:55,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:33:55,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:55,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:55,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:55,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:55,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:55,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:55,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 3 times [2025-03-04 15:33:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:55,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418258199] [2025-03-04 15:33:55,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:55,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:55,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:55,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:33:55,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:55,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:55,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:55,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:55,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1315636420, now seen corresponding path program 2 times [2025-03-04 15:33:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947502738] [2025-03-04 15:33:55,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:55,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 15:33:55,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:55,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:55,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:55,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:33:55,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:55,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:55,371 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:55,371 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:55,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:55,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:55,371 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:55,371 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:55,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:55,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2025-03-04 15:33:55,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:55,372 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:55,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,418 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:55,419 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:55,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,422 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:55,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:33:55,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:55,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,442 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:55,442 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:55,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-04 15:33:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,451 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-04 15:33:55,455 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-04 15:33:55,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:55,456 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,474 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:55,474 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:55,479 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-04 15:33:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,481 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-04 15:33:55,482 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-04 15:33:55,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:55,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,498 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-04 15:33:55,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,500 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-04 15:33:55,501 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-04 15:33:55,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:55,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,524 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:55,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 15:33:55,528 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:55,528 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:55,528 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:55,528 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:55,528 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:55,528 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,528 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:55,528 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:55,528 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2025-03-04 15:33:55,528 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:55,528 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:55,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,577 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:55,578 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:55,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,581 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-04 15:33:55,582 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-04 15:33:55,583 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-04 15:33:55,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:55,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:55,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:55,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:55,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:55,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:55,597 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:55,603 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-04 15:33:55,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,605 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:55,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:33:55,607 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-04 15:33:55,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:55,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:55,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:55,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:55,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:55,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:55,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:55,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:55,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,629 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-04 15:33:55,630 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-04 15:33:55,630 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-04 15:33:55,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:55,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:55,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:55,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:55,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:55,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:55,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:55,642 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:55,644 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:55,644 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:33:55,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,646 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-04 15:33:55,647 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-04 15:33:55,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:55,648 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:55,648 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:55,648 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-04 15:33:55,653 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-04 15:33:55,654 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:55,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:55,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:55,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:55,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:55,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:55,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:55,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:55,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:55,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:55,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:33:55,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:55,683 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-04 15:33:55,683 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-04 15:33:55,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 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-04 15:33:55,693 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. 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 14 states and 21 transitions. Complement of second has 5 states. [2025-03-04 15:33:55,693 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-04 15:33:55,694 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-04 15:33:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 15:33:55,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:33:55,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:55,694 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:55,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:55,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:55,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:55,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:55,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:55,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:55,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:55,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:55,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:55,721 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:33:55,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:55,723 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-04 15:33:55,723 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-04 15:33:55,724 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 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-04 15:33:55,730 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. 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 14 states and 21 transitions. Complement of second has 5 states. [2025-03-04 15:33:55,730 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-04 15:33:55,731 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-04 15:33:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 15:33:55,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:33:55,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:55,731 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:55,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:55,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:55,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:55,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:55,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:55,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:55,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:55,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:55,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:55,752 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:33:55,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:55,754 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-04 15:33:55,754 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-04 15:33:55,754 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 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-04 15:33:55,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. 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 16 states and 24 transitions. Complement of second has 4 states. [2025-03-04 15:33:55,760 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-04 15:33:55,761 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-04 15:33:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:33:55,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:33:55,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:55,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-04 15:33:55,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:55,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-04 15:33:55,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:55,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 24 transitions. [2025-03-04 15:33:55,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:33:55,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 20 transitions. [2025-03-04 15:33:55,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-04 15:33:55,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:33:55,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-03-04 15:33:55,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:55,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-04 15:33:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-03-04 15:33:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 6. [2025-03-04 15:33:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-04 15:33:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2025-03-04 15:33:55,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-03-04 15:33:55,763 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-03-04 15:33:55,763 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:33:55,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2025-03-04 15:33:55,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:33:55,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:55,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:55,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:33:55,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:33:55,764 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-03-04 15:33:55,764 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-03-04 15:33:55,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:55,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 2 times [2025-03-04 15:33:55,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:55,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742494890] [2025-03-04 15:33:55,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:55,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:55,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:55,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:33:55,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,768 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:55,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:55,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:55,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:55,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:55,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1120, now seen corresponding path program 1 times [2025-03-04 15:33:55,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:55,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481626624] [2025-03-04 15:33:55,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:55,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:55,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:55,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:55,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:55,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:55,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:55,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1137983, now seen corresponding path program 3 times [2025-03-04 15:33:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:55,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834847320] [2025-03-04 15:33:55,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:55,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:55,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:55,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:55,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:33:55,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,778 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:55,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:55,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:55,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:55,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:55,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:55,803 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:55,803 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:55,804 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:55,804 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:55,804 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:55,804 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,804 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:55,804 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:55,804 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2025-03-04 15:33:55,804 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:55,804 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:55,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,848 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:55,848 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:55,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,850 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-04 15:33:55,851 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-04 15:33:55,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:55,852 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:55,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,870 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-04 15:33:55,870 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-04 15:33:55,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:55,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,892 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:55,892 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=1} Honda state: {ULTIMATE.start_main_~c~0#1=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0#1=1}, {ULTIMATE.start_main_~c~0#1=0}, {ULTIMATE.start_main_~c~0#1=0}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-03-04 15:33:55,898 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-04 15:33:55,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,900 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-04 15:33:55,901 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-04 15:33:55,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:55,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,918 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-04 15:33:55,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:55,920 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-04 15:33:55,921 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-04 15:33:55,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:55,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:55,943 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:55,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-04 15:33:55,947 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:55,947 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:55,947 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:55,947 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:55,947 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:55,947 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:55,947 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:55,947 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:55,947 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2025-03-04 15:33:55,947 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:55,947 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:55,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:55,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,003 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:56,003 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:56,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,006 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-04 15:33:56,008 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-04 15:33:56,009 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-04 15:33:56,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:56,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:56,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:56,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:56,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:56,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:56,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:56,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:56,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:56,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,028 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-04 15:33:56,029 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-04 15:33:56,030 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-04 15:33:56,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:56,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:56,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:56,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:56,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:56,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:56,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:56,042 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:56,043 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:56,043 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:33:56,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,045 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 15:33:56,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:56,046 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:56,046 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:56,046 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 211 Supporting invariants [] [2025-03-04 15:33:56,053 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-04 15:33:56,054 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:56,086 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-04 15:33:56,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:56,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:56,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:56,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:56,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:56,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:56,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,105 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,107 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-04 15:33:56,108 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-04 15:33:56,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3 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-04 15:33:56,113 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3. 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 18 transitions. Complement of second has 5 states. [2025-03-04 15:33:56,113 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-04 15:33:56,114 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-04 15:33:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-03-04 15:33:56,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 15:33:56,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:56,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:33:56,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:56,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-04 15:33:56,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:56,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2025-03-04 15:33:56,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:33:56,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 14 transitions. [2025-03-04 15:33:56,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 15:33:56,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-04 15:33:56,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-04 15:33:56,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:56,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:33:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-04 15:33:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-04 15:33:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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-04 15:33:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-03-04 15:33:56,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-04 15:33:56,116 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-04 15:33:56,116 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:33:56,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-03-04 15:33:56,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:33:56,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:56,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:56,117 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2025-03-04 15:33:56,117 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:33:56,117 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-03-04 15:33:56,117 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" [2025-03-04 15:33:56,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash 35277447, now seen corresponding path program 2 times [2025-03-04 15:33:56,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:56,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502147800] [2025-03-04 15:33:56,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:56,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:56,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-03-04 15:33:56,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:56,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:56,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502147800] [2025-03-04 15:33:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502147800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:56,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:56,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:33:56,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003861561] [2025-03-04 15:33:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:56,165 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:33:56,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1090, now seen corresponding path program 2 times [2025-03-04 15:33:56,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:56,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617101031] [2025-03-04 15:33:56,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:56,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:56,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:56,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:33:56,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:56,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:56,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:56,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:56,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:56,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:56,192 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:56,192 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:56,192 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:56,192 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:56,192 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:56,192 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,192 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:56,193 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:56,193 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2025-03-04 15:33:56,193 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:56,193 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:56,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,235 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:56,235 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:56,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,237 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 15:33:56,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:56,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:56,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:33:56,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,256 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 15:33:56,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:56,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:56,279 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:56,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 15:33:56,282 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:56,283 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:56,283 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:56,283 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:56,283 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:56,283 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,283 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:56,283 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:56,283 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2025-03-04 15:33:56,283 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:56,283 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:56,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,325 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:56,325 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:56,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,327 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 15:33:56,329 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-04 15:33:56,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:56,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:56,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:56,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:56,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:56,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:56,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:56,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 15:33:56,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,351 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 15:33:56,352 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-04 15:33:56,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:56,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:56,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:56,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:56,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:56,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:56,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:56,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:56,366 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:56,366 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:33:56,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,368 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 15:33:56,369 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:56,369 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:56,369 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:56,369 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 211 Supporting invariants [] [2025-03-04 15:33:56,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 15:33:56,377 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:56,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:56,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:56,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:56,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:56,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,399 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,428 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-04 15:33:56,428 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-04 15:33:56,429 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 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-04 15:33:56,435 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. 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 14 states and 18 transitions. Complement of second has 5 states. [2025-03-04 15:33:56,436 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-04 15:33:56,437 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-04 15:33:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-03-04 15:33:56,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 15:33:56,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:56,438 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:56,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:56,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:56,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:56,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:56,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,460 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,476 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-04 15:33:56,477 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-04 15:33:56,477 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 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-04 15:33:56,487 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. 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 11 states and 15 transitions. Complement of second has 5 states. [2025-03-04 15:33:56,487 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-04 15:33:56,488 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-04 15:33:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:33:56,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 15:33:56,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:56,488 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:56,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:56,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:56,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:56,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:56,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,508 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,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-04 15:33:56,520 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-04 15:33:56,520 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 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-04 15:33:56,527 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. 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 21 transitions. Complement of second has 4 states. [2025-03-04 15:33:56,527 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-04 15:33:56,528 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-04 15:33:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-04 15:33:56,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 15:33:56,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:56,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-04 15:33:56,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:56,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-04 15:33:56,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:56,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2025-03-04 15:33:56,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:33:56,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 17 transitions. [2025-03-04 15:33:56,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-04 15:33:56,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-04 15:33:56,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-03-04 15:33:56,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:56,530 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-04 15:33:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-03-04 15:33:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2025-03-04 15:33:56,530 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-04 15:33:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-03-04 15:33:56,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-04 15:33:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:56,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:33:56,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:33:56,533 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-04 15:33:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:56,542 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2025-03-04 15:33:56,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2025-03-04 15:33:56,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:56,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 11 transitions. [2025-03-04 15:33:56,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-04 15:33:56,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-04 15:33:56,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2025-03-04 15:33:56,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:56,543 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-03-04 15:33:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2025-03-04 15:33:56,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-04 15:33:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-03-04 15:33:56,544 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-03-04 15:33:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:33:56,545 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-03-04 15:33:56,545 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:33:56,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2025-03-04 15:33:56,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:56,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:56,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:56,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2025-03-04 15:33:56,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-03-04 15:33:56,546 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-03-04 15:33:56,546 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-03-04 15:33:56,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash -458081912, now seen corresponding path program 3 times [2025-03-04 15:33:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:56,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636629841] [2025-03-04 15:33:56,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:56,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 3 equivalence classes. [2025-03-04 15:33:56,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:56,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:33:56,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:56,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:56,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:56,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:56,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:56,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:56,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1047588, now seen corresponding path program 1 times [2025-03-04 15:33:56,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:56,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419699316] [2025-03-04 15:33:56,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:56,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:56,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:56,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:56,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:56,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:56,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:56,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:56,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:56,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:56,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1718360619, now seen corresponding path program 4 times [2025-03-04 15:33:56,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:56,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624547478] [2025-03-04 15:33:56,557 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:56,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:56,559 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 11 statements into 2 equivalence classes. [2025-03-04 15:33:56,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:33:56,561 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:33:56,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:56,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:56,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:33:56,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:33:56,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:56,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:56,598 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:56,598 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:56,598 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:56,598 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:56,598 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:56,598 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,598 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:56,598 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:56,598 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2025-03-04 15:33:56,598 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:56,598 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:56,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,635 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:56,635 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:56,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,637 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 15:33:56,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:56,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:56,658 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:56,658 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:56,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:56,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,667 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 15:33:56,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:56,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:56,685 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:56,685 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:56,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-04 15:33:56,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,692 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 15:33:56,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:56,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:56,711 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:56,711 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=1} Honda state: {ULTIMATE.start_main_~c~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:56,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 15:33:56,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,718 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 15:33:56,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:56,720 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:56,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 15:33:56,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,737 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 15:33:56,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:56,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:56,751 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:56,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:56,757 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:56,757 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:56,757 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:56,757 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:56,757 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:56,757 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,757 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:56,757 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:56,757 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2025-03-04 15:33:56,757 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:56,757 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:56,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:56,798 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:56,798 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:56,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,800 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 15:33:56,801 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-04 15:33:56,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:56,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:56,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:56,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:56,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:56,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:56,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:56,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:56,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:56,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,820 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 15:33:56,821 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-04 15:33:56,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:56,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:56,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:56,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:56,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:56,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:56,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:56,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 15:33:56,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,843 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 15:33:56,845 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-04 15:33:56,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:56,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:56,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:56,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:56,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:56,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:56,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:56,857 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:56,859 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:56,859 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:33:56,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:56,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:56,860 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:56,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 15:33:56,862 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:56,862 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:56,862 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:56,862 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 201 Supporting invariants [] [2025-03-04 15:33:56,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:56,867 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:56,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:56,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:56,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:56,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:56,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:56,922 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:56,923 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:56,928 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 17 transitions. Complement of second has 5 states. [2025-03-04 15:33:56,930 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-04 15:33:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-03-04 15:33:56,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:33:56,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:56,931 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:56,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:56,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:56,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:56,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:56,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:56,977 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:56,978 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:56,987 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 15 transitions. Complement of second has 5 states. [2025-03-04 15:33:56,987 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-04 15:33:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:33:56,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:33:56,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:56,988 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:56,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:56,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:56,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:56,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:56,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:56,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:56,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:57,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:57,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 15:33:57,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-04 15:33:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:57,058 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 3 loop predicates [2025-03-04 15:33:57,058 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,063 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 4 states. [2025-03-04 15:33:57,063 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-04 15:33:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-04 15:33:57,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:33:57,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:57,064 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:57,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:57,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:57,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:57,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:57,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:57,116 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:57,116 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,129 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 19 transitions. Complement of second has 4 states. [2025-03-04 15:33:57,130 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-04 15:33:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:33:57,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:33:57,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:57,131 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:57,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:57,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:57,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:57,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:57,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:57,185 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:57,186 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,224 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 82 states and 109 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2025-03-04 15:33:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2025-03-04 15:33:57,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:33:57,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:57,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-04 15:33:57,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:57,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 8 letters. [2025-03-04 15:33:57,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:57,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 109 transitions. [2025-03-04 15:33:57,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 15:33:57,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 37 states and 51 transitions. [2025-03-04 15:33:57,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2025-03-04 15:33:57,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2025-03-04 15:33:57,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2025-03-04 15:33:57,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:57,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-03-04 15:33:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2025-03-04 15:33:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2025-03-04 15:33:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2025-03-04 15:33:57,229 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-03-04 15:33:57,229 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-03-04 15:33:57,229 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:33:57,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2025-03-04 15:33:57,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:33:57,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:57,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:57,230 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2025-03-04 15:33:57,230 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1] [2025-03-04 15:33:57,230 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-03-04 15:33:57,230 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-03-04 15:33:57,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash -458081912, now seen corresponding path program 5 times [2025-03-04 15:33:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:57,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529236694] [2025-03-04 15:33:57,230 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:33:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:57,233 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 3 equivalence classes. [2025-03-04 15:33:57,234 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:57,235 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 15:33:57,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:57,235 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:57,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:57,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:57,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:57,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:57,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1006732166, now seen corresponding path program 2 times [2025-03-04 15:33:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:57,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595526031] [2025-03-04 15:33:57,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:57,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:33:57,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:57,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:57,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:57,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:57,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:57,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:57,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:57,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:57,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2077113293, now seen corresponding path program 6 times [2025-03-04 15:33:57,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:57,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356672035] [2025-03-04 15:33:57,244 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:33:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:57,246 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 6 equivalence classes. [2025-03-04 15:33:57,251 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:33:57,251 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 15:33:57,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:33:57,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:57,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356672035] [2025-03-04 15:33:57,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356672035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:33:57,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186085285] [2025-03-04 15:33:57,300 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:33:57,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:33:57,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:57,302 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:33:57,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-03-04 15:33:57,321 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 6 equivalence classes. [2025-03-04 15:33:57,325 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:33:57,325 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 15:33:57,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:33:57,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:33:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:33:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186085285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:33:57,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:33:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-04 15:33:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277116467] [2025-03-04 15:33:57,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:33:57,414 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:57,414 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:57,414 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:57,414 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:57,414 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:57,414 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:57,414 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:57,414 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:57,414 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2025-03-04 15:33:57,414 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:57,414 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:57,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:57,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:57,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:57,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:57,454 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:57,454 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:57,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:57,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:57,456 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:57,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 15:33:57,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:57,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:57,474 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:57,474 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:57,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-04 15:33:57,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:57,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:57,481 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:57,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 15:33:57,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:57,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:57,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-04 15:33:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:57,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:57,499 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:57,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 15:33:57,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:57,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:57,532 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:57,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 15:33:57,537 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:57,537 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:57,537 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:57,537 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:57,537 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:57,537 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:57,537 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:57,537 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:57,537 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2025-03-04 15:33:57,537 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:57,537 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:57,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:57,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:57,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:57,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:57,585 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:57,585 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:57,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:57,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:57,588 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:57,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 15:33:57,590 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-04 15:33:57,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:57,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:57,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:57,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:57,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:57,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:57,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:57,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-04 15:33:57,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:57,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:57,617 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:57,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 15:33:57,620 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-04 15:33:57,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:57,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:57,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:57,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:57,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:57,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:57,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:57,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:57,635 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:57,635 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:33:57,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:57,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:57,637 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:57,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 15:33:57,640 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:57,640 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:57,640 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:57,640 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-04 15:33:57,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:57,646 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:57,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:57,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:57,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:57,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:57,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,699 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-04 15:33:57,699 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-04 15:33:57,700 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,725 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 81 states and 108 transitions. Complement of second has 9 states. [2025-03-04 15:33:57,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-03-04 15:33:57,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:33:57,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:57,727 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:57,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:57,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:57,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:57,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:57,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,774 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-04 15:33:57,774 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-04 15:33:57,774 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,796 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 105 transitions. Complement of second has 9 states. [2025-03-04 15:33:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-03-04 15:33:57,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:33:57,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:57,797 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:57,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:33:57,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:33:57,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:57,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:57,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:33:57,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:57,848 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-04 15:33:57,849 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 4 loop predicates [2025-03-04 15:33:57,849 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 72 states and 99 transitions. Complement of second has 13 states. [2025-03-04 15:33:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-03-04 15:33:57,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:33:57,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:57,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-04 15:33:57,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:57,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 12 letters. [2025-03-04 15:33:57,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:57,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 99 transitions. [2025-03-04 15:33:57,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-04 15:33:57,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 57 states and 81 transitions. [2025-03-04 15:33:57,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 15:33:57,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-04 15:33:57,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 81 transitions. [2025-03-04 15:33:57,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:57,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 81 transitions. [2025-03-04 15:33:57,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 81 transitions. [2025-03-04 15:33:57,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2025-03-04 15:33:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 40 states have internal predecessors, (61), 0 states have call successors, (0), 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-04 15:33:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2025-03-04 15:33:57,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 61 transitions. [2025-03-04 15:33:57,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:57,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:33:57,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:33:57,876 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-04 15:33:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:57,886 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2025-03-04 15:33:57,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 107 transitions. [2025-03-04 15:33:57,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-03-04 15:33:57,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 59 states and 85 transitions. [2025-03-04 15:33:57,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:33:57,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:33:57,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 85 transitions. [2025-03-04 15:33:57,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:57,888 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 85 transitions. [2025-03-04 15:33:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 85 transitions. [2025-03-04 15:33:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-03-04 15:33:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 51 states have internal predecessors, (75), 0 states have call successors, (0), 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-04 15:33:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-03-04 15:33:57,890 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-04 15:33:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:33:57,891 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-04 15:33:57,891 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:33:57,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 75 transitions. [2025-03-04 15:33:57,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-03-04 15:33:57,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:57,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:57,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2025-03-04 15:33:57,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 4, 3] [2025-03-04 15:33:57,892 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-03-04 15:33:57,892 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-03-04 15:33:57,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2130023351, now seen corresponding path program 7 times [2025-03-04 15:33:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:57,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385801797] [2025-03-04 15:33:57,893 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:33:57,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:57,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:57,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:57,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:57,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:57,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:57,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:57,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:57,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:57,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,902 INFO L85 PathProgramCache]: Analyzing trace with hash -88096372, now seen corresponding path program 3 times [2025-03-04 15:33:57,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:57,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914998901] [2025-03-04 15:33:57,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:57,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:57,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 7 equivalence classes. [2025-03-04 15:33:57,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:33:57,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 15:33:57,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:57,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 15:33:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:33:57,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:57,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914998901] [2025-03-04 15:33:57,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914998901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:57,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:57,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:33:57,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820145651] [2025-03-04 15:33:57,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:57,937 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:33:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:57,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:33:57,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:33:57,939 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. cyclomatic complexity: 28 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:57,947 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2025-03-04 15:33:57,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 95 transitions. [2025-03-04 15:33:57,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2025-03-04 15:33:57,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 55 states and 75 transitions. [2025-03-04 15:33:57,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 15:33:57,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-04 15:33:57,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 75 transitions. [2025-03-04 15:33:57,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:57,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 75 transitions. [2025-03-04 15:33:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 75 transitions. [2025-03-04 15:33:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2025-03-04 15:33:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 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-04 15:33:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-04 15:33:57,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-04 15:33:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:33:57,953 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-04 15:33:57,953 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:33:57,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 69 transitions. [2025-03-04 15:33:57,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2025-03-04 15:33:57,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:57,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:57,954 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2025-03-04 15:33:57,954 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 5, 3] [2025-03-04 15:33:57,954 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-03-04 15:33:57,954 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-03-04 15:33:57,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2130023351, now seen corresponding path program 8 times [2025-03-04 15:33:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076585305] [2025-03-04 15:33:57,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:57,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-04 15:33:57,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:57,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:57,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:57,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:57,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:57,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:57,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:57,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:57,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:57,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash -475448658, now seen corresponding path program 4 times [2025-03-04 15:33:57,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:57,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997729248] [2025-03-04 15:33:57,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:57,967 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:33:57,970 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:33:57,970 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:33:57,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:58,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997729248] [2025-03-04 15:33:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997729248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:33:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156395231] [2025-03-04 15:33:58,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:58,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:33:58,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:58,041 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:33:58,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-03-04 15:33:58,056 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:33:58,060 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:33:58,060 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:33:58,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:58,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:33:58,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:58,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:33:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156395231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:33:58,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:33:58,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 15:33:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044687567] [2025-03-04 15:33:58,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:33:58,131 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:33:58,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:58,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:33:58,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:33:58,131 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. cyclomatic complexity: 25 Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:58,156 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2025-03-04 15:33:58,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 168 transitions. [2025-03-04 15:33:58,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-03-04 15:33:58,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 93 states and 107 transitions. [2025-03-04 15:33:58,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-04 15:33:58,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:33:58,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 107 transitions. [2025-03-04 15:33:58,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:58,157 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 107 transitions. [2025-03-04 15:33:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 107 transitions. [2025-03-04 15:33:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2025-03-04 15:33:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.15) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 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-04 15:33:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2025-03-04 15:33:58,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 92 transitions. [2025-03-04 15:33:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:33:58,160 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 92 transitions. [2025-03-04 15:33:58,161 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:33:58,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 92 transitions. [2025-03-04 15:33:58,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2025-03-04 15:33:58,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:58,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:58,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-03-04 15:33:58,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 7, 6] [2025-03-04 15:33:58,161 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-03-04 15:33:58,161 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-03-04 15:33:58,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1093601822, now seen corresponding path program 4 times [2025-03-04 15:33:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:58,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105660501] [2025-03-04 15:33:58,162 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:58,163 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:33:58,164 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:58,164 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:33:58,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:58,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:58,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:58,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:58,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:58,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:58,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:58,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1196015539, now seen corresponding path program 5 times [2025-03-04 15:33:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018620117] [2025-03-04 15:33:58,166 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:33:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:58,168 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 13 equivalence classes. [2025-03-04 15:33:58,173 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:33:58,173 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-04 15:33:58,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:58,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:58,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:33:58,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:33:58,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:58,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:58,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:58,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1979428906, now seen corresponding path program 9 times [2025-03-04 15:33:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:58,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437544542] [2025-03-04 15:33:58,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:58,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 15 equivalence classes. [2025-03-04 15:33:58,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:33:58,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 15:33:58,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:58,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:58,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:33:58,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:33:58,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:58,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:58,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:58,393 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:58,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:58,394 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:58,394 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:58,394 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:58,394 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:58,394 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:58,394 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:58,394 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration10_Loop [2025-03-04 15:33:58,394 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:58,394 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:58,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:58,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:58,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:58,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:58,433 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:58,433 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:58,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:58,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:58,436 INFO L229 MonitoredProcess]: Starting monitored process 55 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-04 15:33:58,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 15:33:58,438 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:58,438 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:58,455 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:58,455 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:58,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-04 15:33:58,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:58,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:58,463 INFO L229 MonitoredProcess]: Starting monitored process 56 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-04 15:33:58,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 15:33:58,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:58,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:58,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 15:33:58,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:58,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:58,482 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:58,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 15:33:58,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:58,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:58,504 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:58,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-04 15:33:58,509 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:58,509 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:58,509 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:58,509 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:58,509 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:58,509 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:58,509 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:58,509 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:58,509 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration10_Loop [2025-03-04 15:33:58,509 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:58,509 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:58,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:58,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:58,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:58,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:58,552 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:58,552 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:58,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:58,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:58,555 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:58,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 15:33:58,557 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-04 15:33:58,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:58,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:58,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:58,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:58,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:58,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:33:58,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:58,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:58,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:58,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:58,584 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:58,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 15:33:58,587 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-04 15:33:58,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:58,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:58,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:58,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:58,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:58,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:58,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:58,599 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:58,603 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:58,603 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:33:58,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:58,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:58,605 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:58,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 15:33:58,607 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:58,607 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:58,607 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:58,607 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-04 15:33:58,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:58,613 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:58,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:58,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:58,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:58,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:58,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:58,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:58,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:58,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:33:58,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:33:58,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:58,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:58,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:33:58,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:58,814 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2025-03-04 15:33:58,814 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:58,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 86 states and 101 transitions. Complement of second has 5 states. [2025-03-04 15:33:58,817 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-04 15:33:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:33:58,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 26 letters. [2025-03-04 15:33:58,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:58,818 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:58,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:58,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:58,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:58,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:58,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:58,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:58,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:58,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:33:58,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:33:58,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:58,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:58,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:33:58,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:59,022 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2025-03-04 15:33:59,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:59,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 86 states and 101 transitions. Complement of second has 5 states. [2025-03-04 15:33:59,026 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-04 15:33:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:33:59,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 26 letters. [2025-03-04 15:33:59,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:59,026 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:59,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:59,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:59,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:59,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:59,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:59,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:59,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:59,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:33:59,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:33:59,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:59,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:59,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:33:59,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:59,220 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 13 loop predicates [2025-03-04 15:33:59,221 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:59,226 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 115 states and 134 transitions. Complement of second has 4 states. [2025-03-04 15:33:59,226 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-04 15:33:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:33:59,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 26 letters. [2025-03-04 15:33:59,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:59,227 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:59,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:59,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:59,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:59,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:59,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:59,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:59,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:59,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:33:59,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 15:33:59,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:33:59,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:59,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:59,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:33:59,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:59,444 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2025-03-04 15:33:59,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:59,470 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 137 states and 157 transitions. Complement of second has 8 states. [2025-03-04 15:33:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-04 15:33:59,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 26 letters. [2025-03-04 15:33:59,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:59,471 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:59,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:59,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:59,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:59,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:59,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:59,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:59,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:59,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:33:59,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:33:59,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:59,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:59,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:33:59,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:59,665 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2025-03-04 15:33:59,665 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:59,707 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,709 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,711 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,711 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,711 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,740 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,740 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,740 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,740 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,767 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,767 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,767 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,767 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,833 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,833 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,834 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,834 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,866 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,866 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,867 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,867 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,867 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,867 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,867 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,868 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:33:59,873 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 859 states and 1158 transitions. Complement of second has 221 states 28 powerset states193 rank states. The highest rank that occured is 7 [2025-03-04 15:33:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 15:33:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2025-03-04 15:33:59,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 63 transitions. Stem has 6 letters. Loop has 26 letters. [2025-03-04 15:33:59,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:59,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 63 transitions. Stem has 32 letters. Loop has 26 letters. [2025-03-04 15:33:59,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:59,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 63 transitions. Stem has 6 letters. Loop has 52 letters. [2025-03-04 15:33:59,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:59,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 859 states and 1158 transitions. [2025-03-04 15:33:59,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2025-03-04 15:33:59,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 859 states to 289 states and 350 transitions. [2025-03-04 15:33:59,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-04 15:33:59,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:33:59,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 350 transitions. [2025-03-04 15:33:59,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:59,903 INFO L218 hiAutomatonCegarLoop]: Abstraction has 289 states and 350 transitions. [2025-03-04 15:33:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 350 transitions. [2025-03-04 15:33:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 215. [2025-03-04 15:33:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 215 states have (on average 1.2186046511627906) internal successors, (262), 214 states have internal predecessors, (262), 0 states have call successors, (0), 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-04 15:33:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 262 transitions. [2025-03-04 15:33:59,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 215 states and 262 transitions. [2025-03-04 15:33:59,913 INFO L432 stractBuchiCegarLoop]: Abstraction has 215 states and 262 transitions. [2025-03-04 15:33:59,913 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:33:59,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 262 transitions. [2025-03-04 15:33:59,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2025-03-04 15:33:59,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:59,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:59,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-03-04 15:33:59,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 8, 7] [2025-03-04 15:33:59,918 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_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-03-04 15:33:59,918 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-03-04 15:33:59,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:59,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1093601822, now seen corresponding path program 5 times [2025-03-04 15:33:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:59,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529301592] [2025-03-04 15:33:59,919 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:33:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:59,921 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:33:59,922 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:59,922 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:59,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:59,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:59,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:33:59,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:33:59,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:59,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:59,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:59,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -136993910, now seen corresponding path program 6 times [2025-03-04 15:33:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244492156] [2025-03-04 15:33:59,926 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:33:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:59,930 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 15 equivalence classes. [2025-03-04 15:33:59,934 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:33:59,935 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-04 15:33:59,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:59,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:59,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:33:59,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:33:59,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:59,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:59,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:59,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1292509977, now seen corresponding path program 10 times [2025-03-04 15:33:59,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:59,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239093295] [2025-03-04 15:33:59,943 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:59,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:59,945 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-04 15:33:59,948 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:33:59,948 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:33:59,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:59,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:59,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:33:59,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:33:59,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:59,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:59,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:00,150 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:00,150 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:00,150 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:00,150 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:00,150 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:00,150 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:00,150 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:00,150 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:00,150 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration11_Loop [2025-03-04 15:34:00,150 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:00,150 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:00,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:00,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:00,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:00,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:00,183 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:00,183 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:00,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:00,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:00,185 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:00,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 15:34:00,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:00,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:00,203 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:00,203 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:00,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-04 15:34:00,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:00,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:00,211 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:00,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 15:34:00,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:00,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:00,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 15:34:00,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:00,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:00,230 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:00,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 15:34:00,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:00,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:00,272 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:00,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 15:34:00,276 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:00,276 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:00,276 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:00,276 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:00,276 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:00,276 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:00,276 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:00,276 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:00,276 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration11_Loop [2025-03-04 15:34:00,276 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:00,276 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:00,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:00,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:00,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:00,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:00,317 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:00,317 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:00,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:00,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:00,319 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:00,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 15:34:00,321 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-04 15:34:00,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:00,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:00,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:00,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:00,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:34:00,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:34:00,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:00,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 15:34:00,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:00,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:00,341 INFO L229 MonitoredProcess]: Starting monitored process 65 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-04 15:34:00,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 15:34:00,343 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-04 15:34:00,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:00,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:00,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:00,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:00,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:00,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:00,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:00,355 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:00,357 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:34:00,357 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:34:00,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:00,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:00,358 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:00,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 15:34:00,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:00,360 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:00,360 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:00,360 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2025-03-04 15:34:00,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 15:34:00,365 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:00,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:00,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:34:00,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:34:00,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:00,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:00,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:00,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:00,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:34:00,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:34:00,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:00,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:00,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:34:00,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:00,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 15:34:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 102 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 15:34:00,502 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-04 15:34:00,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-04 15:34:00,507 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Result 227 states and 286 transitions. Complement of second has 5 states. [2025-03-04 15:34:00,507 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-04 15:34:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-04 15:34:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:34:00,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 30 letters. [2025-03-04 15:34:00,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:00,507 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:34:00,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:00,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:34:00,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:34:00,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:00,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:00,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:00,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:00,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:34:00,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:34:00,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:00,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:00,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:34:00,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 102 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 15:34:00,624 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-04 15:34:00,624 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-04 15:34:00,632 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Result 227 states and 286 transitions. Complement of second has 5 states. [2025-03-04 15:34:00,632 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-04 15:34:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-04 15:34:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:34:00,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 30 letters. [2025-03-04 15:34:00,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:00,633 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:34:00,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:00,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:34:00,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:34:00,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:00,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:00,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:00,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:34:00,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:34:00,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:00,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:00,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:34:00,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 102 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 15:34:00,750 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 6 loop predicates [2025-03-04 15:34:00,750 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-04 15:34:00,763 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Result 329 states and 404 transitions. Complement of second has 7 states. [2025-03-04 15:34:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-04 15:34:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-04 15:34:00,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 30 letters. [2025-03-04 15:34:00,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:00,767 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:34:00,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:00,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:34:00,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:34:00,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:00,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:00,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:00,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:00,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:34:00,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:34:00,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:00,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:00,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:34:00,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 102 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 15:34:00,883 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-04 15:34:00,883 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-04 15:34:00,911 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Result 461 states and 551 transitions. Complement of second has 12 states. [2025-03-04 15:34:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-04 15:34:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-03-04 15:34:00,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 30 letters. [2025-03-04 15:34:00,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:00,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 36 letters. Loop has 30 letters. [2025-03-04 15:34:00,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:00,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 60 letters. [2025-03-04 15:34:00,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:00,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 461 states and 551 transitions. [2025-03-04 15:34:00,916 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:34:00,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 461 states to 0 states and 0 transitions. [2025-03-04 15:34:00,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:34:00,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:34:00,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:34:00,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:34:00,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:34:00,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:34:00,917 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:34:00,917 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 15:34:00,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:34:00,917 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:34:00,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:34:00,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:34:00 BoogieIcfgContainer [2025-03-04 15:34:00,922 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:34:00,923 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:34:00,923 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:34:00,923 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:34:00,930 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:54" (3/4) ... [2025-03-04 15:34:00,932 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:34:00,932 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:34:00,933 INFO L158 Benchmark]: Toolchain (without parser) took 7106.80ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 111.7MB in the end (delta: 1.2MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2025-03-04 15:34:00,933 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:34:00,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 128.59ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 102.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:34:00,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.82ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 102.2MB in the end (delta: 491.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:34:00,934 INFO L158 Benchmark]: Boogie Preprocessor took 17.83ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 101.2MB in the end (delta: 490.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:34:00,934 INFO L158 Benchmark]: IcfgBuilder took 153.99ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 91.4MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:34:00,934 INFO L158 Benchmark]: BuchiAutomizer took 6777.35ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 36.2MB in the end (delta: 55.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2025-03-04 15:34:00,934 INFO L158 Benchmark]: Witness Printer took 9.39ms. Allocated memory is still 142.6MB. Free memory was 36.2MB in the beginning and 111.7MB in the end (delta: -75.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:34:00,935 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.38ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 128.59ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 102.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.82ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 102.2MB in the end (delta: 491.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.83ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 101.2MB in the end (delta: 490.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 153.99ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 91.4MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6777.35ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 36.2MB in the end (delta: 55.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 9.39ms. Allocated memory is still 142.6MB. Free memory was 36.2MB in the beginning and 111.7MB in the end (delta: -75.5MB). Peak memory consumption was 8.4MB. 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 13 terminating modules (4 trivial, 3 deterministic, 6 nondeterministic). One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function (211 + ((long) -2 * n)) and consists of 3 locations. One nondeterministic module has affine ranking function n and consists of 3 locations. One nondeterministic module has affine ranking function (211 + ((long) -2 * n)) and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * n) + 201) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 15 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 12 iterations. TraceHistogramMax:15. Analysis of lassos took 3.6s. Construction of modules took 0.2s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 148 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 3, 1, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 233/374 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 159 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT7 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax163 hnf100 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp98 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:34:00,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-03-04 15:34:01,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:01,348 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 Result: TRUE