./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/eca-rers2012/Problem01_label43.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 409e906c97fdb83aebfefc37fd10289c280112661b5f3b33ba432f9c10381db1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:48:03,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:48:04,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:48:04,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:48:04,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:48:04,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:48:04,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:48:04,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:48:04,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:48:04,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:48:04,074 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:48:04,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:48:04,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:48:04,075 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:48:04,075 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:48:04,075 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:48:04,075 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:48:04,075 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:48:04,075 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:48:04,075 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:48:04,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:48:04,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:48:04,075 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:48:04,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:48:04,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:48:04,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:48:04,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:48:04,076 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:48:04,077 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 409e906c97fdb83aebfefc37fd10289c280112661b5f3b33ba432f9c10381db1 [2025-03-04 15:48:04,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:48:04,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:48:04,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:48:04,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:48:04,291 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:48:04,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label43.c [2025-03-04 15:48:05,403 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276033b68/56aded9ddfa44982b90fab03cc1cc5f4/FLAG303f3578c [2025-03-04 15:48:05,734 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:48:05,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label43.c [2025-03-04 15:48:05,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276033b68/56aded9ddfa44982b90fab03cc1cc5f4/FLAG303f3578c [2025-03-04 15:48:05,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276033b68/56aded9ddfa44982b90fab03cc1cc5f4 [2025-03-04 15:48:05,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:48:05,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:48:05,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:48:05,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:48:05,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:48:05,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:48:05" (1/1) ... [2025-03-04 15:48:05,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34dc6e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:05, skipping insertion in model container [2025-03-04 15:48:05,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:48:05" (1/1) ... [2025-03-04 15:48:05,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:48:06,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:48:06,018 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:48:06,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:48:06,103 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:48:06,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06 WrapperNode [2025-03-04 15:48:06,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:48:06,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:48:06,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:48:06,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:48:06,110 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:48:06" (1/1) ... [2025-03-04 15:48:06,119 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:48:06" (1/1) ... [2025-03-04 15:48:06,158 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 654 [2025-03-04 15:48:06,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:48:06,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:48:06,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:48:06,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:48:06,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (1/1) ... [2025-03-04 15:48:06,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (1/1) ... [2025-03-04 15:48:06,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (1/1) ... [2025-03-04 15:48:06,195 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:48:06,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (1/1) ... [2025-03-04 15:48:06,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (1/1) ... [2025-03-04 15:48:06,213 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (1/1) ... [2025-03-04 15:48:06,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (1/1) ... [2025-03-04 15:48:06,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (1/1) ... [2025-03-04 15:48:06,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (1/1) ... [2025-03-04 15:48:06,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:48:06,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:48:06,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:48:06,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:48:06,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (1/1) ... [2025-03-04 15:48:06,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:06,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:06,264 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:48:06,268 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:48:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:48:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:48:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:48:06,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:48:06,345 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:48:06,346 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:48:07,017 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-04 15:48:07,018 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:48:07,028 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:48:07,029 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:48:07,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:48:07 BoogieIcfgContainer [2025-03-04 15:48:07,030 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:48:07,030 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:48:07,031 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:48:07,034 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:48:07,035 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:48:07,035 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:48:05" (1/3) ... [2025-03-04 15:48:07,036 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@192591f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:48:07, skipping insertion in model container [2025-03-04 15:48:07,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:48:07,037 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:06" (2/3) ... [2025-03-04 15:48:07,037 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@192591f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:48:07, skipping insertion in model container [2025-03-04 15:48:07,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:48:07,037 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:48:07" (3/3) ... [2025-03-04 15:48:07,038 INFO L363 chiAutomizerObserver]: Analyzing ICFG Problem01_label43.c [2025-03-04 15:48:07,079 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:48:07,079 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:48:07,079 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:48:07,079 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:48:07,079 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:48:07,080 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:48:07,080 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:48:07,080 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:48:07,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 198 states, 197 states have (on average 1.6548223350253808) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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:48:07,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2025-03-04 15:48:07,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:07,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:07,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:48:07,110 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:48:07,111 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:48:07,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 198 states, 197 states have (on average 1.6548223350253808) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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:48:07,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2025-03-04 15:48:07,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:07,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:07,121 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:48:07,121 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:48:07,126 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" [2025-03-04 15:48:07,126 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume (15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0;~a16~0 := 5;~a20~0 := 0;calculate_output_#res#1 := 24;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" [2025-03-04 15:48:07,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash 13568, now seen corresponding path program 1 times [2025-03-04 15:48:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:07,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154431798] [2025-03-04 15:48:07,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:07,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:07,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:48:07,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:48:07,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:07,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:07,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:07,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:48:07,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:48:07,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:07,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:07,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:07,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash 12952452, now seen corresponding path program 1 times [2025-03-04 15:48:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:07,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682918476] [2025-03-04 15:48:07,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:07,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:07,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:07,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:07,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:07,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:07,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:07,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:07,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:07,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:07,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:07,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:07,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:07,259 INFO L85 PathProgramCache]: Analyzing trace with hash -342540029, now seen corresponding path program 1 times [2025-03-04 15:48:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:07,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107417777] [2025-03-04 15:48:07,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:07,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:07,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:07,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:07,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:07,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:07,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:07,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:07,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:07,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:07,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:07,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:07,433 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:07,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:07,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:07,434 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:07,434 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:48:07,434 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,434 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:07,434 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:07,434 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label43.c_Iteration1_Loop [2025-03-04 15:48:07,434 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:07,434 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:07,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,599 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:07,600 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:48:07,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,603 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:48:07,605 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:48:07,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,640 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,640 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_~input#1=0} Honda state: {ULTIMATE.start_calculate_output_~input#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,648 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:48:07,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,650 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:48:07,651 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:48:07,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,666 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,666 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,671 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:48:07,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,673 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:48:07,675 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:48:07,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,687 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,687 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=1} Honda state: {~a17~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,693 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:48:07,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,695 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:48:07,697 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:48:07,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,720 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,720 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a16~0=5} Honda state: {~a16~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:07,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,729 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:48:07,732 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:48:07,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,745 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,746 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input#1=0} Honda state: {ULTIMATE.start_calculate_output_#in~input#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,751 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:48:07,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,777 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:48:07,779 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:48:07,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,792 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,793 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret7#1=0} Honda state: {ULTIMATE.start_main_#t~ret7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 15:48:07,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,800 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:48:07,801 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:48:07,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,814 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,814 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0#1=0} Honda state: {ULTIMATE.start_main_~input~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,822 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:48:07,857 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:48:07,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,872 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,872 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet6#1=0} Honda state: {ULTIMATE.start_main_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:07,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,880 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:48:07,882 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:48:07,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,900 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,900 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a7~0=4} Honda state: {~a7~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:07,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,907 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:48:07,908 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:48:07,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,921 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,921 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,926 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:48:07,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,928 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:48:07,930 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:48:07,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,941 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:07,941 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=15} Honda state: {~a8~0=15} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:07,948 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:48:07,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,949 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:48:07,950 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:48:07,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:07,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 15:48:07,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:07,970 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:48:07,970 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:48:07,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:48:07,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:07,983 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:48:07,990 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:48:07,991 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:07,991 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:07,991 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:07,991 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:07,991 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:48:07,991 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:07,991 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:07,991 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:07,991 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label43.c_Iteration1_Loop [2025-03-04 15:48:07,991 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:07,991 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:07,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:07,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:08,100 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:08,103 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:48:08,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,106 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:48:08,107 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:48:08,109 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:48:08,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:08,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:08,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,131 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:48:08,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,133 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:48:08,135 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:48:08,136 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:48:08,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:08,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:08,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,155 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:48:08,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,157 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:48:08,158 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:48:08,160 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:48:08,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,170 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:48:08,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,173 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:48:08,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,181 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:48:08,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,184 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:48:08,184 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:48:08,187 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:48:08,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:08,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:08,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,206 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:48:08,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,208 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:48:08,210 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:48:08,211 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:48:08,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:08,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:08,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:08,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,232 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:48:08,232 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:48:08,234 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:48:08,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:08,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:08,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,251 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:48:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,254 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:48:08,254 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:48:08,255 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:48:08,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:08,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:08,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,272 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:48:08,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,274 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:48:08,274 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:48:08,275 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:48:08,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,286 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:48:08,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,289 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:48:08,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,297 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:48:08,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,299 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:48:08,300 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:48:08,302 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:48:08,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:08,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:08,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,325 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:48:08,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,327 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:48:08,329 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:48:08,330 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:48:08,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:08,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:08,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:08,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,351 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:48:08,352 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:48:08,353 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:48:08,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:08,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:08,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:08,372 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:48:08,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,374 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:48:08,375 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:48:08,377 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:48:08,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:08,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:08,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:08,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:08,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:08,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:08,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:08,390 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:48:08,394 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:48:08,395 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:48:08,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:08,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:08,398 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:48:08,400 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:48:08,401 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:48:08,401 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:48:08,402 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:48:08,402 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a20~0) = 1*~a20~0 Supporting invariants [] [2025-03-04 15:48:08,408 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:48:08,410 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:48:08,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:08,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:48:08,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:48:08,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:08,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:08,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:48:08,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:08,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:08,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:08,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:08,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:08,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:48:08,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:08,496 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:48:08,513 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:48:08,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 198 states, 197 states have (on average 1.6548223350253808) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:08,949 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 198 states, 197 states have (on average 1.6548223350253808) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 788 states and 1201 transitions. Complement of second has 6 states. [2025-03-04 15:48:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:48:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2025-03-04 15:48:08,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 622 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-04 15:48:08,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:08,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 622 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-04 15:48:08,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:08,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 622 transitions. Stem has 2 letters. Loop has 8 letters. [2025-03-04 15:48:08,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:08,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 788 states and 1201 transitions. [2025-03-04 15:48:08,971 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 324 [2025-03-04 15:48:08,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 788 states to 461 states and 681 transitions. [2025-03-04 15:48:08,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2025-03-04 15:48:08,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2025-03-04 15:48:08,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 681 transitions. [2025-03-04 15:48:08,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:08,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 461 states and 681 transitions. [2025-03-04 15:48:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 681 transitions. [2025-03-04 15:48:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-03-04 15:48:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 459 states have (on average 1.4793028322440087) internal successors, (679), 458 states have internal predecessors, (679), 0 states have call successors, (0), 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:48:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 679 transitions. [2025-03-04 15:48:09,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 459 states and 679 transitions. [2025-03-04 15:48:09,021 INFO L432 stractBuchiCegarLoop]: Abstraction has 459 states and 679 transitions. [2025-03-04 15:48:09,021 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:48:09,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 459 states and 679 transitions. [2025-03-04 15:48:09,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 324 [2025-03-04 15:48:09,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:09,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:09,024 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:48:09,024 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:48:09,024 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" [2025-03-04 15:48:09,024 INFO L754 eck$LassoCheckResult]: Loop: "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume 1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0;~a8~0 := 13;~a7~0 := 1;~a16~0 := 4;calculate_output_#res#1 := -1;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" [2025-03-04 15:48:09,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:09,024 INFO L85 PathProgramCache]: Analyzing trace with hash 420999, now seen corresponding path program 1 times [2025-03-04 15:48:09,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:09,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137376098] [2025-03-04 15:48:09,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:09,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:09,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:48:09,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:48:09,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:09,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:09,031 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:09,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:48:09,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:48:09,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:09,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:09,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:09,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:09,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1519553970, now seen corresponding path program 1 times [2025-03-04 15:48:09,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:09,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946826248] [2025-03-04 15:48:09,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:09,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:09,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:48:09,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:48:09,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:09,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:09,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:09,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:48:09,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:48:09,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:09,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:09,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:09,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:09,057 INFO L85 PathProgramCache]: Analyzing trace with hash 292750088, now seen corresponding path program 1 times [2025-03-04 15:48:09,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:09,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400114726] [2025-03-04 15:48:09,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:09,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:09,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:48:09,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:48:09,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:09,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:09,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:09,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:48:09,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:48:09,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:09,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:09,100 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:48:09,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:09,228 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:09,228 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:09,228 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:09,228 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:09,228 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:48:09,228 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,228 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:09,228 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:09,228 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label43.c_Iteration2_Loop [2025-03-04 15:48:09,229 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:09,229 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:09,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,342 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:09,342 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:48:09,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,344 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:48:09,346 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:48:09,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:09,347 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:09,359 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:09,359 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res#1=0} Honda state: {ULTIMATE.start_calculate_output_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:09,364 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:48:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,366 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:48:09,367 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:48:09,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:09,368 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:09,390 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:48:09,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,393 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:09,394 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:48:09,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:48:09,395 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:09,421 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:48:09,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:48:09,425 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:09,425 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:09,425 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:09,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:09,425 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:48:09,425 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,425 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:09,425 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:09,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label43.c_Iteration2_Loop [2025-03-04 15:48:09,425 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:09,425 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:09,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:09,562 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:09,562 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:48:09,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,564 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:48:09,567 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:48:09,569 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:48:09,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:09,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:09,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:09,579 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:48:09,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:09,580 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:48:09,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:09,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:09,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:09,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,590 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:48:09,591 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:48:09,593 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:48:09,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:09,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:09,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:09,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:09,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:09,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:09,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:09,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:09,611 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:48:09,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,613 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:48:09,615 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:48:09,616 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:48:09,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:09,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:09,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:09,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:09,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:09,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:09,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:09,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:09,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:09,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,636 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:48:09,637 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:48:09,638 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:48:09,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:09,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:09,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:09,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:09,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:09,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:09,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:09,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:09,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:09,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,661 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:48:09,662 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:48:09,664 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:48:09,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:09,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:09,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:09,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:09,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:09,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:09,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:09,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:09,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:09,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,686 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:48:09,687 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:48:09,688 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:48:09,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:09,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:09,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:09,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:09,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:09,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:09,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:09,700 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:09,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:09,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,707 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:48:09,709 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:48:09,711 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:48:09,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:09,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:09,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:09,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:09,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:09,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:09,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:09,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:09,728 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:48:09,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,730 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:48:09,731 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:48:09,732 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:48:09,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:09,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:09,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:09,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:09,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:09,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:09,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:09,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:09,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-04 15:48:09,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,751 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:48:09,752 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:48:09,753 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:48:09,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:09,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:09,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:09,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:09,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:09,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:09,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:09,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:09,770 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:48:09,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,772 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:48:09,773 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:48:09,773 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:48:09,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:09,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:09,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:09,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:09,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:09,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:09,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:09,790 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:48:09,792 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:48:09,792 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:48:09,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:09,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:09,794 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:48:09,795 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:48:09,795 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:48:09,795 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:48:09,795 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:48:09,795 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a8~0) = 1*~a8~0 Supporting invariants [] [2025-03-04 15:48:09,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:09,801 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:48:09,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:09,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:48:09,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:48:09,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:09,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:09,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:48:09,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:09,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:48:09,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:48:09,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:09,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:09,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:48:09,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:09,854 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:48:09,855 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:48:09,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 459 states and 679 transitions. cyclomatic complexity: 223 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:48:10,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:10,225 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 459 states and 679 transitions. cyclomatic complexity: 223. 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 1571 states and 2220 transitions. Complement of second has 6 states. [2025-03-04 15:48:10,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:48:10,226 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:48:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2025-03-04 15:48:10,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 630 transitions. Stem has 3 letters. Loop has 7 letters. [2025-03-04 15:48:10,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:10,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 630 transitions. Stem has 10 letters. Loop has 7 letters. [2025-03-04 15:48:10,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:10,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 630 transitions. Stem has 3 letters. Loop has 14 letters. [2025-03-04 15:48:10,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:10,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1571 states and 2220 transitions. [2025-03-04 15:48:10,234 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 586 [2025-03-04 15:48:10,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1571 states to 1256 states and 1717 transitions. [2025-03-04 15:48:10,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 591 [2025-03-04 15:48:10,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2025-03-04 15:48:10,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1256 states and 1717 transitions. [2025-03-04 15:48:10,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:10,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1256 states and 1717 transitions. [2025-03-04 15:48:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states and 1717 transitions. [2025-03-04 15:48:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1253. [2025-03-04 15:48:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1253 states have (on average 1.3679169992019153) internal successors, (1714), 1252 states have internal predecessors, (1714), 0 states have call successors, (0), 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:48:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1714 transitions. [2025-03-04 15:48:10,265 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1253 states and 1714 transitions. [2025-03-04 15:48:10,265 INFO L432 stractBuchiCegarLoop]: Abstraction has 1253 states and 1714 transitions. [2025-03-04 15:48:10,265 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:48:10,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1253 states and 1714 transitions. [2025-03-04 15:48:10,269 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 586 [2025-03-04 15:48:10,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:10,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:10,270 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:48:10,270 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:48:10,270 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" [2025-03-04 15:48:10,270 INFO L754 eck$LassoCheckResult]: Loop: "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume (1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0;~a17~0 := 0;calculate_output_#res#1 := 26;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" [2025-03-04 15:48:10,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:10,270 INFO L85 PathProgramCache]: Analyzing trace with hash 13051359, now seen corresponding path program 1 times [2025-03-04 15:48:10,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:10,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173250983] [2025-03-04 15:48:10,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:10,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:10,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:10,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:10,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:10,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:10,278 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:10,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:10,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:10,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:10,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:10,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:10,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:10,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2036778729, now seen corresponding path program 1 times [2025-03-04 15:48:10,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:10,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040425396] [2025-03-04 15:48:10,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:10,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:48:10,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:48:10,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:10,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:10,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:10,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:48:10,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:48:10,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:10,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:10,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:10,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash -356791047, now seen corresponding path program 1 times [2025-03-04 15:48:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:10,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733767306] [2025-03-04 15:48:10,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:10,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:10,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:48:10,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:48:10,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:10,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:48:10,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:48:10,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733767306] [2025-03-04 15:48:10,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733767306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:48:10,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:48:10,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:48:10,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940163520] [2025-03-04 15:48:10,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:48:10,510 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:10,510 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:10,510 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:10,511 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:10,511 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:48:10,511 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,511 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:10,511 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:10,511 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label43.c_Iteration3_Loop [2025-03-04 15:48:10,511 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:10,511 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:10,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,644 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:10,645 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:48:10,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:10,650 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:48:10,650 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:48:10,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:10,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:10,663 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:10,663 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:10,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 15:48:10,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:10,671 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:48:10,675 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:48:10,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:10,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:10,687 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:10,688 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=15} Honda state: {~a8~0=15} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:10,694 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:48:10,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:10,696 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:48:10,697 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:48:10,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:10,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:10,711 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:10,711 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input#1=0} Honda state: {ULTIMATE.start_calculate_output_#in~input#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:10,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:10,719 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:48:10,720 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:48:10,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:10,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:10,733 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:10,733 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret7#1=0} Honda state: {ULTIMATE.start_main_#t~ret7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:10,739 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:48:10,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:10,745 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:48:10,746 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:48:10,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:10,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:10,759 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:10,759 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:10,765 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:48:10,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:10,767 INFO L229 MonitoredProcess]: Starting monitored process 47 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:48:10,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 15:48:10,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:10,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:10,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:10,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:10,789 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:48:10,789 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:48:10,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:48:10,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:10,802 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:48:10,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:10,807 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:10,807 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:10,808 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:10,808 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:10,808 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:48:10,808 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,808 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:10,808 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:10,808 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label43.c_Iteration3_Loop [2025-03-04 15:48:10,808 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:10,808 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:10,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:10,942 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:10,942 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:48:10,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:10,944 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:48:10,945 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:48:10,946 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:48:10,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:10,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:10,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:10,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:10,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:10,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:10,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:10,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:10,963 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:48:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:10,965 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:48:10,965 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:48:10,966 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:48:10,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:10,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:10,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:10,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:10,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:10,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:10,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:10,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:10,983 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:48:10,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:10,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:10,985 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:48:10,986 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:48:10,987 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:48:10,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:10,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:10,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:10,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:10,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:10,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:10,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:10,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:11,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:11,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:11,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:11,005 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:48:11,006 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:48:11,007 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:48:11,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:11,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:11,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:11,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:11,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:11,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:11,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:11,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:11,023 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:48:11,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:11,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:11,025 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:48:11,025 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:48:11,026 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:48:11,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:11,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:11,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:11,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:11,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:11,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:11,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:11,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:11,043 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:48:11,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:11,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:11,045 INFO L229 MonitoredProcess]: Starting monitored process 54 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:48:11,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 15:48:11,046 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:48:11,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:11,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:11,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:11,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:11,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:11,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:11,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:11,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:48:11,060 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:48:11,060 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:48:11,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:11,062 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:48:11,062 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:48:11,063 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:48:11,063 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:48:11,063 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:48:11,063 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a17~0) = 1*~a17~0 Supporting invariants [] [2025-03-04 15:48:11,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 15:48:11,069 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:48:11,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:11,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:11,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:11,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:11,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:11,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:48:11,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:11,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:48:11,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:48:11,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:11,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:11,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:48:11,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:11,122 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:48:11,123 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:48:11,123 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 1714 transitions. cyclomatic complexity: 470 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:48:11,194 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:48:11,507 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 1714 transitions. cyclomatic complexity: 470. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) Result 4230 states and 5475 transitions. Complement of second has 6 states. [2025-03-04 15:48:11,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:48:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:48:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 608 transitions. [2025-03-04 15:48:11,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 608 transitions. Stem has 4 letters. Loop has 9 letters. [2025-03-04 15:48:11,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:11,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 608 transitions. Stem has 13 letters. Loop has 9 letters. [2025-03-04 15:48:11,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:11,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 608 transitions. Stem has 4 letters. Loop has 18 letters. [2025-03-04 15:48:11,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:11,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4230 states and 5475 transitions. [2025-03-04 15:48:11,537 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1110 [2025-03-04 15:48:11,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4230 states to 3915 states and 4972 transitions. [2025-03-04 15:48:11,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1121 [2025-03-04 15:48:11,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1126 [2025-03-04 15:48:11,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3915 states and 4972 transitions. [2025-03-04 15:48:11,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:11,558 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3915 states and 4972 transitions. [2025-03-04 15:48:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states and 4972 transitions. [2025-03-04 15:48:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3908. [2025-03-04 15:48:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3908 states have (on average 1.2704708290685773) internal successors, (4965), 3907 states have internal predecessors, (4965), 0 states have call successors, (0), 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:48:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 4965 transitions. [2025-03-04 15:48:11,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3908 states and 4965 transitions. [2025-03-04 15:48:11,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:48:11,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:48:11,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:48:11,635 INFO L87 Difference]: Start difference. First operand 3908 states and 4965 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:48:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:48:12,119 INFO L93 Difference]: Finished difference Result 7329 states and 8838 transitions. [2025-03-04 15:48:12,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7329 states and 8838 transitions. [2025-03-04 15:48:12,147 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2096 [2025-03-04 15:48:12,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7329 states to 7268 states and 8746 transitions. [2025-03-04 15:48:12,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2107 [2025-03-04 15:48:12,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2107 [2025-03-04 15:48:12,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7268 states and 8746 transitions. [2025-03-04 15:48:12,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:12,177 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7268 states and 8746 transitions. [2025-03-04 15:48:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states and 8746 transitions. [2025-03-04 15:48:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 7268. [2025-03-04 15:48:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7268 states, 7268 states have (on average 1.2033571821684095) internal successors, (8746), 7267 states have internal predecessors, (8746), 0 states have call successors, (0), 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:48:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 8746 transitions. [2025-03-04 15:48:12,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7268 states and 8746 transitions. [2025-03-04 15:48:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:48:12,262 INFO L432 stractBuchiCegarLoop]: Abstraction has 7268 states and 8746 transitions. [2025-03-04 15:48:12,262 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:48:12,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7268 states and 8746 transitions. [2025-03-04 15:48:12,284 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2096 [2025-03-04 15:48:12,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:12,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:12,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:48:12,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:48:12,287 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-04 15:48:12,287 INFO L754 eck$LassoCheckResult]: Loop: "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume !((1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0);" "assume !((8 == ~a12~0 && (1 == ~a21~0 && ((5 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(8 == ~a12~0 && 1 == calculate_output_~input#1 && ((1 == ~a21~0 && (15 == ~a8~0 && (!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && 13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0)));" "assume !((((!(1 == ~a17~0) && !(1 == ~a7~0) && 1 == ~a21~0 && 15 == ~a8~0 && 4 == calculate_output_~input#1) && !(1 == ~a20~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 2 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && ((3 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0))) && 8 == ~a12~0) && 1 == ~a7~0);" "assume !(((1 == ~a21~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1 && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || (5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0))) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !((5 == ~a16~0 && (1 == ~a7~0 && (!(1 == ~a21~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (15 == ~a8~0 && (8 == ~a12~0 && (!(1 == ~a7~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a20~0)) && 5 == ~a16~0);" "assume !(!(1 == ~a7~0) && (((1 == ~a21~0 && (15 == ~a8~0 && 5 == calculate_output_~input#1) && !(1 == ~a17~0)) && 8 == ~a12~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !((!(1 == ~a21~0) && (8 == ~a12~0 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0)) && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a7~0);" "assume !(1 == ~a17~0 && !(1 == ~a7~0) && (1 == ~a21~0 && (8 == ~a12~0 && 5 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && !(1 == ~a21~0) && 1 == ~a7~0 && 13 == ~a8~0 && 6 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (4 == ~a16~0 && !(1 == ~a17~0))) || (5 == ~a16~0 && !(1 == ~a17~0)))) && 1 == ~a20~0);" "assume !((5 == ~a16~0 && ((15 == ~a8~0 && (!(1 == ~a7~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a12~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(!(1 == ~a20~0) && 1 == ~a21~0 && 4 == ~a16~0 && 15 == ~a8~0 && (8 == ~a12~0 && 2 == calculate_output_~input#1 && !(1 == ~a7~0)) && !(1 == ~a17~0));" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && (!(1 == ~a20~0) && !(1 == ~a17~0) && 8 == ~a12~0 && 6 == calculate_output_~input#1) && 4 == ~a16~0) && 15 == ~a8~0);" "assume !(1 == ~a17~0 && ((((8 == ~a12~0 && 4 == calculate_output_~input#1 && 13 == ~a8~0) && 1 == ~a20~0) && !(1 == ~a21~0)) && 5 == ~a16~0) && 1 == ~a7~0);" "assume !(((13 == ~a8~0 && 8 == ~a12~0 && ((((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0)) && 1 == calculate_output_~input#1) && !(1 == ~a21~0)) && 1 == ~a20~0) && 1 == ~a7~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && (((((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 5 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0);" "assume !((!(1 == ~a21~0) && ((((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)) && 4 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0) && 13 == ~a8~0);" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && ((((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && ((1 == ~a7~0 && 1 == ~a17~0) && 1 == ~a20~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(!(1 == ~a17~0) && (8 == ~a12~0 && !(1 == ~a20~0) && (15 == ~a8~0 && 1 == ~a21~0 && 4 == calculate_output_~input#1) && !(1 == ~a7~0)) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && (2 == calculate_output_~input#1 && (((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 15 == ~a8~0) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(!(1 == ~a20~0) && (((((6 == calculate_output_~input#1 && 5 == ~a16~0) && 1 == ~a21~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !(8 == ~a12~0 && (((((1 == ~a21~0 && 5 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0);" "assume !(((15 == ~a8~0 && !(1 == ~a7~0) && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 5 == ~a16~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(15 == ~a8~0 && 4 == ~a16~0 && !(1 == ~a20~0) && ((1 == ~a21~0 && !(1 == ~a17~0) && 5 == calculate_output_~input#1) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && 8 == ~a12~0 && 15 == ~a8~0 && ((!(1 == ~a7~0) && (5 == ~a16~0 || 6 == ~a16~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(!(1 == ~a7~0) && (15 == ~a8~0 && (!(1 == ~a17~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(5 == ~a16~0 && (!(1 == ~a21~0) && (13 == ~a8~0 && (2 == calculate_output_~input#1 && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && 1 == ~a17~0);" "assume !(1 == ~a20~0 && (8 == ~a12~0 && 1 == ~a7~0 && 13 == ~a8~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 3 == calculate_output_~input#1) && !(1 == ~a21~0));" "assume !(8 == ~a12~0 && 1 == ~a7~0 && !(1 == ~a21~0) && 13 == ~a8~0 && 6 == calculate_output_~input#1 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))));" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && ((4 == ~a16~0 && 15 == ~a8~0 && 1 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a20~0) && 8 == ~a12~0 && 15 == ~a8~0 && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && 6 == ~a16~0);" "assume !(1 == ~a20~0 && 8 == ~a12~0 && ((1 == ~a17~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 4 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((13 == ~a8~0 && (((!(1 == ~a21~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a17~0) && 1 == ~a7~0) && 5 == ~a16~0);" "assume !(5 == ~a16~0 && (((8 == ~a12~0 && !(1 == ~a7~0) && 2 == calculate_output_~input#1 && !(1 == ~a20~0)) && 1 == ~a21~0) && 1 == ~a17~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && ((!(1 == ~a17~0) && 1 == ~a21~0 && 4 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !(1 == ~a7~0 && 13 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a21~0) && 2 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)));" "assume !(((((((!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (((13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 4 == ~a16~0) && !(1 == ~a21~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && (((3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 15 == ~a8~0) && 8 == ~a12~0) && !(1 == ~a20~0));" "assume !((((8 == ~a12~0 && (((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0) || ((1 == ~a20~0 && !(1 == ~a17~0)) && 5 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) && 3 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((!(1 == ~a7~0) && (5 == calculate_output_~input#1 && (((5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !((!(1 == ~a7~0) && (1 == ~a21~0 && (1 == ~a17~0 && 8 == ~a12~0 && 2 == calculate_output_~input#1) && !(1 == ~a20~0)) && 6 == ~a16~0) && 15 == ~a8~0);" "assume !((!(1 == ~a17~0) && 1 == ~a21~0 && (!(1 == ~a20~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0);" "assume !((5 == ~a16~0 && !(1 == ~a20~0) && (((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(!(1 == ~a7~0) && 1 == ~a17~0 && (6 == ~a16~0 && !(1 == ~a20~0) && (6 == calculate_output_~input#1 && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a7~0) && !(1 == ~a17~0) && 2 == calculate_output_~input#1) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(15 == ~a8~0 && (4 == ~a16~0 && 8 == ~a12~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && !(1 == ~a17~0)) && 1 == ~a21~0);" "assume !(1 == ~a21~0 && (8 == ~a12~0 && ((1 == ~a17~0 && 3 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && !(1 == ~a7~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !(!(1 == ~a21~0) && 1 == ~a20~0 && (8 == ~a12~0 && 13 == ~a8~0 && ((5 == ~a16~0 && !(1 == ~a17~0)) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 2 == calculate_output_~input#1) && 1 == ~a7~0);" "assume !(1 == ~a7~0 && 8 == ~a12~0 && ((1 == ~a20~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (4 == ~a16~0 && !(1 == ~a17~0))) && 4 == calculate_output_~input#1) && 13 == ~a8~0) && !(1 == ~a21~0));" "assume !(1 == ~a21~0 && (((!(1 == ~a7~0) && 15 == ~a8~0 && !(1 == ~a20~0) && 4 == calculate_output_~input#1) && 1 == ~a17~0) && 5 == ~a16~0) && 8 == ~a12~0);" "assume !(((!(1 == ~a7~0) && (!(1 == ~a20~0) && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 1 == ~a17~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !((((!(1 == ~a17~0) && !(1 == ~a20~0) && 15 == ~a8~0 && 1 == calculate_output_~input#1 && 5 == ~a16~0) && 8 == ~a12~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && (5 == ~a16~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0));" "assume !((!(1 == ~a21~0) && 1 == ~a20~0 && ((13 == ~a8~0 && 1 == ~a7~0 && 5 == calculate_output_~input#1) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && 1 == ~a21~0 && ((6 == calculate_output_~input#1 && 1 == ~a20~0) && 15 == ~a8~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume ((1 == ~a20~0 && ((!(1 == ~a21~0) && 1 == ~a7~0 && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0;~a21~0 := 1;~a16~0 := 6;~a7~0 := 0;calculate_output_#res#1 := -1;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-04 15:48:12,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:12,288 INFO L85 PathProgramCache]: Analyzing trace with hash 404592514, now seen corresponding path program 1 times [2025-03-04 15:48:12,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:12,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488513338] [2025-03-04 15:48:12,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:12,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:12,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:48:12,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:48:12,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:12,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:12,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:12,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:48:12,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:48:12,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:12,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:12,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:12,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash 844816958, now seen corresponding path program 1 times [2025-03-04 15:48:12,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:12,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633393998] [2025-03-04 15:48:12,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:12,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 15:48:12,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:48:12,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:12,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:12,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:12,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 15:48:12,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:48:12,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:12,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:12,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:12,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1102465343, now seen corresponding path program 1 times [2025-03-04 15:48:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:12,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683574401] [2025-03-04 15:48:12,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:12,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 15:48:12,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 15:48:12,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:12,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:48:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:48:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683574401] [2025-03-04 15:48:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683574401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:48:12,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:48:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:48:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044266361] [2025-03-04 15:48:12,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:48:12,851 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:12,852 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:12,852 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:12,852 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:12,852 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:48:12,852 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:12,852 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:12,852 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:12,852 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label43.c_Iteration4_Loop [2025-03-04 15:48:12,852 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:12,852 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:12,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:12,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,000 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:13,001 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:48:13,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,003 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:48:13,003 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:48:13,004 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:13,004 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:13,015 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:13,015 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:13,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:13,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,023 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:48:13,024 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:48:13,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:13,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:13,043 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:13,043 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_~input#1=1} Honda state: {ULTIMATE.start_calculate_output_~input#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:13,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:13,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,050 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:48:13,051 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:48:13,052 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:13,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:13,063 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:13,063 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=13} Honda state: {~a8~0=13} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:13,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 15:48:13,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,070 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:48:13,070 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:48:13,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:13,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:13,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 15:48:13,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,090 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:48:13,090 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:48:13,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:48:13,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:13,102 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:48:13,108 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:48:13,108 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:13,108 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:13,108 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:13,108 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:13,108 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:48:13,108 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,108 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:13,108 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:13,108 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label43.c_Iteration4_Loop [2025-03-04 15:48:13,108 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:13,108 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:13,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:13,261 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:13,261 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:48:13,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,263 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:48:13,264 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:48:13,264 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:48:13,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:13,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:13,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:13,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:13,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:13,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:13,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:13,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:13,282 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:48:13,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,284 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:48:13,285 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:48:13,285 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:48:13,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:13,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:13,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:13,295 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-03-04 15:48:13,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:13,298 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-04 15:48:13,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:13,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:13,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:13,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,312 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:48:13,313 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:48:13,314 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:48:13,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:13,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:13,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:13,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:13,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:13,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:13,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:13,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:13,332 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:48:13,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,334 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:48:13,334 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:48:13,335 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:48:13,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:13,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:13,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:13,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:13,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:13,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:13,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:13,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:13,353 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:48:13,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,355 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:48:13,357 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:48:13,357 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:48:13,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:13,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:13,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:13,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:13,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:13,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:13,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:13,371 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:48:13,372 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:48:13,372 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:48:13,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:13,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:13,374 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:48:13,374 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:48:13,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:48:13,375 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:48:13,375 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:48:13,375 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a7~0) = 1*~a7~0 Supporting invariants [] [2025-03-04 15:48:13,381 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:48:13,381 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:48:13,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:13,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:48:13,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:48:13,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:13,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:13,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:48:13,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:13,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 15:48:13,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:48:13,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:13,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:13,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:48:13,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:13,525 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:48:13,526 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:48:13,526 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7268 states and 8746 transitions. cyclomatic complexity: 1515 Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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:48:13,721 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:48:13,894 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7268 states and 8746 transitions. cyclomatic complexity: 1515. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 24257 states and 28318 transitions. Complement of second has 5 states. [2025-03-04 15:48:13,895 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:48:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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:48:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-03-04 15:48:13,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 5 letters. Loop has 68 letters. [2025-03-04 15:48:13,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:13,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 73 letters. Loop has 68 letters. [2025-03-04 15:48:13,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:13,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 5 letters. Loop has 136 letters. [2025-03-04 15:48:13,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:13,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24257 states and 28318 transitions. [2025-03-04 15:48:13,973 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 4192 [2025-03-04 15:48:14,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24257 states to 24257 states and 28318 transitions. [2025-03-04 15:48:14,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4231 [2025-03-04 15:48:14,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4243 [2025-03-04 15:48:14,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24257 states and 28318 transitions. [2025-03-04 15:48:14,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:14,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24257 states and 28318 transitions. [2025-03-04 15:48:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24257 states and 28318 transitions. [2025-03-04 15:48:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24257 to 24234. [2025-03-04 15:48:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24234 states, 24234 states have (on average 1.1675744821325411) internal successors, (28295), 24233 states have internal predecessors, (28295), 0 states have call successors, (0), 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:48:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24234 states to 24234 states and 28295 transitions. [2025-03-04 15:48:14,452 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24234 states and 28295 transitions. [2025-03-04 15:48:14,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:48:14,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:48:14,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:48:14,452 INFO L87 Difference]: Start difference. First operand 24234 states and 28295 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 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:48:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:48:15,109 INFO L93 Difference]: Finished difference Result 48032 states and 54853 transitions. [2025-03-04 15:48:15,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48032 states and 54853 transitions. [2025-03-04 15:48:15,266 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 8384 [2025-03-04 15:48:15,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48032 states to 45131 states and 51547 transitions. [2025-03-04 15:48:15,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8441 [2025-03-04 15:48:15,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8441 [2025-03-04 15:48:15,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45131 states and 51547 transitions. [2025-03-04 15:48:15,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:15,398 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45131 states and 51547 transitions. [2025-03-04 15:48:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45131 states and 51547 transitions. [2025-03-04 15:48:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45131 to 41166. [2025-03-04 15:48:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41166 states, 41166 states have (on average 1.1480590778798037) internal successors, (47261), 41165 states have internal predecessors, (47261), 0 states have call successors, (0), 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:48:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41166 states to 41166 states and 47261 transitions. [2025-03-04 15:48:15,934 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41166 states and 47261 transitions. [2025-03-04 15:48:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:48:15,935 INFO L432 stractBuchiCegarLoop]: Abstraction has 41166 states and 47261 transitions. [2025-03-04 15:48:15,935 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:48:15,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41166 states and 47261 transitions. [2025-03-04 15:48:15,994 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-04 15:48:15,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:15,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:15,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:48:15,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:48:15,995 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-04 15:48:15,996 INFO L754 eck$LassoCheckResult]: Loop: "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume !((1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0);" "assume !((8 == ~a12~0 && (1 == ~a21~0 && ((5 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(8 == ~a12~0 && 1 == calculate_output_~input#1 && ((1 == ~a21~0 && (15 == ~a8~0 && (!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && 13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0)));" "assume !((((!(1 == ~a17~0) && !(1 == ~a7~0) && 1 == ~a21~0 && 15 == ~a8~0 && 4 == calculate_output_~input#1) && !(1 == ~a20~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 2 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && ((3 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0))) && 8 == ~a12~0) && 1 == ~a7~0);" "assume !(((1 == ~a21~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1 && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || (5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0))) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !((5 == ~a16~0 && (1 == ~a7~0 && (!(1 == ~a21~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (15 == ~a8~0 && (8 == ~a12~0 && (!(1 == ~a7~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a20~0)) && 5 == ~a16~0);" "assume !(!(1 == ~a7~0) && (((1 == ~a21~0 && (15 == ~a8~0 && 5 == calculate_output_~input#1) && !(1 == ~a17~0)) && 8 == ~a12~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !((!(1 == ~a21~0) && (8 == ~a12~0 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0)) && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a7~0);" "assume !(1 == ~a17~0 && !(1 == ~a7~0) && (1 == ~a21~0 && (8 == ~a12~0 && 5 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && !(1 == ~a21~0) && 1 == ~a7~0 && 13 == ~a8~0 && 6 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (4 == ~a16~0 && !(1 == ~a17~0))) || (5 == ~a16~0 && !(1 == ~a17~0)))) && 1 == ~a20~0);" "assume !((5 == ~a16~0 && ((15 == ~a8~0 && (!(1 == ~a7~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a12~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(!(1 == ~a20~0) && 1 == ~a21~0 && 4 == ~a16~0 && 15 == ~a8~0 && (8 == ~a12~0 && 2 == calculate_output_~input#1 && !(1 == ~a7~0)) && !(1 == ~a17~0));" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && (!(1 == ~a20~0) && !(1 == ~a17~0) && 8 == ~a12~0 && 6 == calculate_output_~input#1) && 4 == ~a16~0) && 15 == ~a8~0);" "assume !(1 == ~a17~0 && ((((8 == ~a12~0 && 4 == calculate_output_~input#1 && 13 == ~a8~0) && 1 == ~a20~0) && !(1 == ~a21~0)) && 5 == ~a16~0) && 1 == ~a7~0);" "assume !(((13 == ~a8~0 && 8 == ~a12~0 && ((((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0)) && 1 == calculate_output_~input#1) && !(1 == ~a21~0)) && 1 == ~a20~0) && 1 == ~a7~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && (((((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 5 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0);" "assume !((!(1 == ~a21~0) && ((((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)) && 4 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0) && 13 == ~a8~0);" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && ((((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && ((1 == ~a7~0 && 1 == ~a17~0) && 1 == ~a20~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(!(1 == ~a17~0) && (8 == ~a12~0 && !(1 == ~a20~0) && (15 == ~a8~0 && 1 == ~a21~0 && 4 == calculate_output_~input#1) && !(1 == ~a7~0)) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && (2 == calculate_output_~input#1 && (((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 15 == ~a8~0) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(!(1 == ~a20~0) && (((((6 == calculate_output_~input#1 && 5 == ~a16~0) && 1 == ~a21~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !(8 == ~a12~0 && (((((1 == ~a21~0 && 5 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0);" "assume !(((15 == ~a8~0 && !(1 == ~a7~0) && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 5 == ~a16~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(15 == ~a8~0 && 4 == ~a16~0 && !(1 == ~a20~0) && ((1 == ~a21~0 && !(1 == ~a17~0) && 5 == calculate_output_~input#1) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && 8 == ~a12~0 && 15 == ~a8~0 && ((!(1 == ~a7~0) && (5 == ~a16~0 || 6 == ~a16~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(!(1 == ~a7~0) && (15 == ~a8~0 && (!(1 == ~a17~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(5 == ~a16~0 && (!(1 == ~a21~0) && (13 == ~a8~0 && (2 == calculate_output_~input#1 && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && 1 == ~a17~0);" "assume !(1 == ~a20~0 && (8 == ~a12~0 && 1 == ~a7~0 && 13 == ~a8~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 3 == calculate_output_~input#1) && !(1 == ~a21~0));" "assume !(8 == ~a12~0 && 1 == ~a7~0 && !(1 == ~a21~0) && 13 == ~a8~0 && 6 == calculate_output_~input#1 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))));" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && ((4 == ~a16~0 && 15 == ~a8~0 && 1 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a20~0) && 8 == ~a12~0 && 15 == ~a8~0 && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && 6 == ~a16~0);" "assume !(1 == ~a20~0 && 8 == ~a12~0 && ((1 == ~a17~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 4 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((13 == ~a8~0 && (((!(1 == ~a21~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a17~0) && 1 == ~a7~0) && 5 == ~a16~0);" "assume !(5 == ~a16~0 && (((8 == ~a12~0 && !(1 == ~a7~0) && 2 == calculate_output_~input#1 && !(1 == ~a20~0)) && 1 == ~a21~0) && 1 == ~a17~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && ((!(1 == ~a17~0) && 1 == ~a21~0 && 4 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !(1 == ~a7~0 && 13 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a21~0) && 2 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)));" "assume !(((((((!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (((13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 4 == ~a16~0) && !(1 == ~a21~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && (((3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 15 == ~a8~0) && 8 == ~a12~0) && !(1 == ~a20~0));" "assume !((((8 == ~a12~0 && (((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0) || ((1 == ~a20~0 && !(1 == ~a17~0)) && 5 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) && 3 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((!(1 == ~a7~0) && (5 == calculate_output_~input#1 && (((5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !((!(1 == ~a7~0) && (1 == ~a21~0 && (1 == ~a17~0 && 8 == ~a12~0 && 2 == calculate_output_~input#1) && !(1 == ~a20~0)) && 6 == ~a16~0) && 15 == ~a8~0);" "assume !((!(1 == ~a17~0) && 1 == ~a21~0 && (!(1 == ~a20~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0);" "assume !((5 == ~a16~0 && !(1 == ~a20~0) && (((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(!(1 == ~a7~0) && 1 == ~a17~0 && (6 == ~a16~0 && !(1 == ~a20~0) && (6 == calculate_output_~input#1 && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a7~0) && !(1 == ~a17~0) && 2 == calculate_output_~input#1) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(15 == ~a8~0 && (4 == ~a16~0 && 8 == ~a12~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && !(1 == ~a17~0)) && 1 == ~a21~0);" "assume !(1 == ~a21~0 && (8 == ~a12~0 && ((1 == ~a17~0 && 3 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && !(1 == ~a7~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !(!(1 == ~a21~0) && 1 == ~a20~0 && (8 == ~a12~0 && 13 == ~a8~0 && ((5 == ~a16~0 && !(1 == ~a17~0)) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 2 == calculate_output_~input#1) && 1 == ~a7~0);" "assume !(1 == ~a7~0 && 8 == ~a12~0 && ((1 == ~a20~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (4 == ~a16~0 && !(1 == ~a17~0))) && 4 == calculate_output_~input#1) && 13 == ~a8~0) && !(1 == ~a21~0));" "assume !(1 == ~a21~0 && (((!(1 == ~a7~0) && 15 == ~a8~0 && !(1 == ~a20~0) && 4 == calculate_output_~input#1) && 1 == ~a17~0) && 5 == ~a16~0) && 8 == ~a12~0);" "assume !(((!(1 == ~a7~0) && (!(1 == ~a20~0) && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 1 == ~a17~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !((((!(1 == ~a17~0) && !(1 == ~a20~0) && 15 == ~a8~0 && 1 == calculate_output_~input#1 && 5 == ~a16~0) && 8 == ~a12~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && (5 == ~a16~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0));" "assume !((!(1 == ~a21~0) && 1 == ~a20~0 && ((13 == ~a8~0 && 1 == ~a7~0 && 5 == calculate_output_~input#1) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && 1 == ~a21~0 && ((6 == calculate_output_~input#1 && 1 == ~a20~0) && 15 == ~a8~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((1 == ~a20~0 && ((!(1 == ~a21~0) && 1 == ~a7~0 && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !(8 == ~a12~0 && 5 == calculate_output_~input#1 && ((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a7~0 && 1 == ~a17~0) && 13 == ~a8~0)));" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "calculate_output_#res#1 := -2;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-04 15:48:15,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash 404592514, now seen corresponding path program 2 times [2025-03-04 15:48:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190959080] [2025-03-04 15:48:15,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:48:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:16,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:48:16,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:48:16,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:48:16,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:16,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:16,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:48:16,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:48:16,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:16,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:16,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:16,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:16,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1722571298, now seen corresponding path program 1 times [2025-03-04 15:48:16,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:16,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180437483] [2025-03-04 15:48:16,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:16,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 15:48:16,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 15:48:16,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:16,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:16,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:16,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 15:48:16,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 15:48:16,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:16,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:16,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:16,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1591809793, now seen corresponding path program 1 times [2025-03-04 15:48:16,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:16,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601768134] [2025-03-04 15:48:16,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:16,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:16,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 15:48:16,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 15:48:16,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:16,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:48:17,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:48:17,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601768134] [2025-03-04 15:48:17,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601768134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:48:17,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:48:17,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:48:17,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224724425] [2025-03-04 15:48:17,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:48:21,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:48:21,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:48:21,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:48:21,147 INFO L87 Difference]: Start difference. First operand 41166 states and 47261 transitions. cyclomatic complexity: 6257 Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 9 states have internal predecessors, (136), 0 states have call successors, (0), 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:48:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:48:21,834 INFO L93 Difference]: Finished difference Result 42262 states and 48369 transitions. [2025-03-04 15:48:21,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42262 states and 48369 transitions. [2025-03-04 15:48:21,917 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-04 15:48:21,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42262 states to 41570 states and 47677 transitions. [2025-03-04 15:48:21,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7384 [2025-03-04 15:48:21,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7384 [2025-03-04 15:48:21,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41570 states and 47677 transitions. [2025-03-04 15:48:21,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:21,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41570 states and 47677 transitions. [2025-03-04 15:48:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41570 states and 47677 transitions. [2025-03-04 15:48:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41570 to 41570. [2025-03-04 15:48:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41570 states, 41570 states have (on average 1.1469088284820783) internal successors, (47677), 41569 states have internal predecessors, (47677), 0 states have call successors, (0), 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:48:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41570 states to 41570 states and 47677 transitions. [2025-03-04 15:48:22,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41570 states and 47677 transitions. [2025-03-04 15:48:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:48:22,415 INFO L432 stractBuchiCegarLoop]: Abstraction has 41570 states and 47677 transitions. [2025-03-04 15:48:22,415 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:48:22,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41570 states and 47677 transitions. [2025-03-04 15:48:22,485 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-04 15:48:22,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:22,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:22,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:48:22,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:48:22,488 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume (15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0;~a16~0 := 5;~a20~0 := 0;calculate_output_#res#1 := 24;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" [2025-03-04 15:48:22,488 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume !((1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0);" "assume !((8 == ~a12~0 && (1 == ~a21~0 && ((5 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(8 == ~a12~0 && 1 == calculate_output_~input#1 && ((1 == ~a21~0 && (15 == ~a8~0 && (!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && 13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0)));" "assume !((((!(1 == ~a17~0) && !(1 == ~a7~0) && 1 == ~a21~0 && 15 == ~a8~0 && 4 == calculate_output_~input#1) && !(1 == ~a20~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 2 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && ((3 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0))) && 8 == ~a12~0) && 1 == ~a7~0);" "assume !(((1 == ~a21~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1 && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || (5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0))) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !((5 == ~a16~0 && (1 == ~a7~0 && (!(1 == ~a21~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (15 == ~a8~0 && (8 == ~a12~0 && (!(1 == ~a7~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a20~0)) && 5 == ~a16~0);" "assume !(!(1 == ~a7~0) && (((1 == ~a21~0 && (15 == ~a8~0 && 5 == calculate_output_~input#1) && !(1 == ~a17~0)) && 8 == ~a12~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !((!(1 == ~a21~0) && (8 == ~a12~0 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0)) && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a7~0);" "assume !(1 == ~a17~0 && !(1 == ~a7~0) && (1 == ~a21~0 && (8 == ~a12~0 && 5 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && !(1 == ~a21~0) && 1 == ~a7~0 && 13 == ~a8~0 && 6 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (4 == ~a16~0 && !(1 == ~a17~0))) || (5 == ~a16~0 && !(1 == ~a17~0)))) && 1 == ~a20~0);" "assume !((5 == ~a16~0 && ((15 == ~a8~0 && (!(1 == ~a7~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a12~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(!(1 == ~a20~0) && 1 == ~a21~0 && 4 == ~a16~0 && 15 == ~a8~0 && (8 == ~a12~0 && 2 == calculate_output_~input#1 && !(1 == ~a7~0)) && !(1 == ~a17~0));" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && (!(1 == ~a20~0) && !(1 == ~a17~0) && 8 == ~a12~0 && 6 == calculate_output_~input#1) && 4 == ~a16~0) && 15 == ~a8~0);" "assume !(1 == ~a17~0 && ((((8 == ~a12~0 && 4 == calculate_output_~input#1 && 13 == ~a8~0) && 1 == ~a20~0) && !(1 == ~a21~0)) && 5 == ~a16~0) && 1 == ~a7~0);" "assume !(((13 == ~a8~0 && 8 == ~a12~0 && ((((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0)) && 1 == calculate_output_~input#1) && !(1 == ~a21~0)) && 1 == ~a20~0) && 1 == ~a7~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && (((((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 5 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0);" "assume !((!(1 == ~a21~0) && ((((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)) && 4 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0) && 13 == ~a8~0);" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && ((((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && ((1 == ~a7~0 && 1 == ~a17~0) && 1 == ~a20~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(!(1 == ~a17~0) && (8 == ~a12~0 && !(1 == ~a20~0) && (15 == ~a8~0 && 1 == ~a21~0 && 4 == calculate_output_~input#1) && !(1 == ~a7~0)) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && (2 == calculate_output_~input#1 && (((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 15 == ~a8~0) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(!(1 == ~a20~0) && (((((6 == calculate_output_~input#1 && 5 == ~a16~0) && 1 == ~a21~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !(8 == ~a12~0 && (((((1 == ~a21~0 && 5 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0);" "assume !(((15 == ~a8~0 && !(1 == ~a7~0) && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 5 == ~a16~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(15 == ~a8~0 && 4 == ~a16~0 && !(1 == ~a20~0) && ((1 == ~a21~0 && !(1 == ~a17~0) && 5 == calculate_output_~input#1) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && 8 == ~a12~0 && 15 == ~a8~0 && ((!(1 == ~a7~0) && (5 == ~a16~0 || 6 == ~a16~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(!(1 == ~a7~0) && (15 == ~a8~0 && (!(1 == ~a17~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(5 == ~a16~0 && (!(1 == ~a21~0) && (13 == ~a8~0 && (2 == calculate_output_~input#1 && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && 1 == ~a17~0);" "assume !(1 == ~a20~0 && (8 == ~a12~0 && 1 == ~a7~0 && 13 == ~a8~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 3 == calculate_output_~input#1) && !(1 == ~a21~0));" "assume !(8 == ~a12~0 && 1 == ~a7~0 && !(1 == ~a21~0) && 13 == ~a8~0 && 6 == calculate_output_~input#1 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))));" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && ((4 == ~a16~0 && 15 == ~a8~0 && 1 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a20~0) && 8 == ~a12~0 && 15 == ~a8~0 && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && 6 == ~a16~0);" "assume !(1 == ~a20~0 && 8 == ~a12~0 && ((1 == ~a17~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 4 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((13 == ~a8~0 && (((!(1 == ~a21~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a17~0) && 1 == ~a7~0) && 5 == ~a16~0);" "assume !(5 == ~a16~0 && (((8 == ~a12~0 && !(1 == ~a7~0) && 2 == calculate_output_~input#1 && !(1 == ~a20~0)) && 1 == ~a21~0) && 1 == ~a17~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && ((!(1 == ~a17~0) && 1 == ~a21~0 && 4 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !(1 == ~a7~0 && 13 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a21~0) && 2 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)));" "assume !(((((((!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (((13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 4 == ~a16~0) && !(1 == ~a21~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && (((3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 15 == ~a8~0) && 8 == ~a12~0) && !(1 == ~a20~0));" "assume !((((8 == ~a12~0 && (((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0) || ((1 == ~a20~0 && !(1 == ~a17~0)) && 5 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) && 3 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((!(1 == ~a7~0) && (5 == calculate_output_~input#1 && (((5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !((!(1 == ~a7~0) && (1 == ~a21~0 && (1 == ~a17~0 && 8 == ~a12~0 && 2 == calculate_output_~input#1) && !(1 == ~a20~0)) && 6 == ~a16~0) && 15 == ~a8~0);" "assume !((!(1 == ~a17~0) && 1 == ~a21~0 && (!(1 == ~a20~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0);" "assume (5 == ~a16~0 && !(1 == ~a20~0) && (((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0) && 15 == ~a8~0;calculate_output_#res#1 := 24;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" [2025-03-04 15:48:22,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash -342540029, now seen corresponding path program 2 times [2025-03-04 15:48:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:22,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020310513] [2025-03-04 15:48:22,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:48:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:22,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:22,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:22,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:48:22,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:22,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:22,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:22,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:22,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:22,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:22,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:22,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash -422041658, now seen corresponding path program 1 times [2025-03-04 15:48:22,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:22,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421139561] [2025-03-04 15:48:22,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:22,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:22,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 15:48:22,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:48:22,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:22,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:22,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:22,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 15:48:22,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:48:22,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:22,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:22,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:22,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:22,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1524994940, now seen corresponding path program 1 times [2025-03-04 15:48:22,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:22,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220465578] [2025-03-04 15:48:22,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:22,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 15:48:22,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 15:48:22,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:22,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:22,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:22,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 15:48:22,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 15:48:22,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:22,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:22,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:23,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:23,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:23,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:23,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:23,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:23,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:23,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:23,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:23,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:23,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:48:23 BoogieIcfgContainer [2025-03-04 15:48:23,279 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:48:23,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:48:23,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:48:23,280 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:48:23,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:48:07" (3/4) ... [2025-03-04 15:48:23,282 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 15:48:23,318 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:48:23,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:48:23,319 INFO L158 Benchmark]: Toolchain (without parser) took 17549.05ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 127.4MB in the beginning and 222.2MB in the end (delta: -94.8MB). Peak memory consumption was 275.0MB. Max. memory is 16.1GB. [2025-03-04 15:48:23,319 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 192.9MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:48:23,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.16ms. Allocated memory is still 167.8MB. Free memory was 127.4MB in the beginning and 101.0MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 15:48:23,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.90ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 95.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:48:23,320 INFO L158 Benchmark]: Boogie Preprocessor took 64.31ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 91.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:48:23,321 INFO L158 Benchmark]: IcfgBuilder took 803.83ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 93.7MB in the end (delta: -2.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 15:48:23,321 INFO L158 Benchmark]: BuchiAutomizer took 16248.91ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 93.7MB in the beginning and 226.5MB in the end (delta: -132.8MB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. [2025-03-04 15:48:23,321 INFO L158 Benchmark]: Witness Printer took 38.64ms. Allocated memory is still 536.9MB. Free memory was 226.5MB in the beginning and 222.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:48:23,322 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.15ms. Allocated memory is still 192.9MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.16ms. Allocated memory is still 167.8MB. Free memory was 127.4MB in the beginning and 101.0MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.90ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 95.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.31ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 91.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 803.83ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 93.7MB in the end (delta: -2.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 16248.91ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 93.7MB in the beginning and 226.5MB in the end (delta: -132.8MB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. * Witness Printer took 38.64ms. Allocated memory is still 536.9MB. Free memory was 226.5MB in the beginning and 222.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function a20 and consists of 4 locations. One deterministic module has affine ranking function a8 and consists of 4 locations. One deterministic module has affine ranking function a17 and consists of 4 locations. One deterministic module has affine ranking function a7 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 41570 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 9.8s. Construction of modules took 2.0s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 1.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 4000 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1335 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1331 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3472 IncrementalHoareTripleChecker+Invalid, 3721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 221 mSDtfsCounter, 3472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT2 conc1 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital44 mio100 ax100 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq208 hnf96 smp100 dnf139 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 593]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\result=24, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) Loop: [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L326] COND TRUE (((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15)) [L327] return 24; [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 593]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\result=24, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) Loop: [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L326] COND TRUE (((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15)) [L327] return 24; [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-04 15:48:23,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)