./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 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_label05.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 5958333028b8f64162c92b3e987d78deaf3d77dc73071d1f6edce3e1a07212a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:03:34,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:03:34,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:03:34,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:03:34,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:03:34,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:03:34,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:03:34,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:03:34,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:03:34,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:03:34,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:03:34,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:03:34,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:03:34,088 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:03:34,088 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:03:34,089 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:03:34,089 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:03:34,089 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:03:34,089 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:03:34,089 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:03:34,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:03:34,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:03:34,089 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:03:34,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:03:34,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:03:34,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:03:34,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:03:34,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:03:34,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:03:34,090 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:03:34,090 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:03:34,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:03:34,090 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:03:34,090 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:03:34,090 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:03:34,090 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:03:34,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:03:34,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:03:34,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:03:34,091 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:03:34,091 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 -> 5958333028b8f64162c92b3e987d78deaf3d77dc73071d1f6edce3e1a07212a4 [2025-03-17 20:03:34,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:03:34,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:03:34,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:03:34,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:03:34,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:03:34,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2025-03-17 20:03:35,629 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9242db367/b947be61e91c4780ba74352afabd5b2e/FLAG49d3eb8bb [2025-03-17 20:03:35,944 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:03:35,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2025-03-17 20:03:35,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9242db367/b947be61e91c4780ba74352afabd5b2e/FLAG49d3eb8bb [2025-03-17 20:03:36,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9242db367/b947be61e91c4780ba74352afabd5b2e [2025-03-17 20:03:36,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:03:36,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:03:36,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:03:36,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:03:36,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:03:36,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d715085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36, skipping insertion in model container [2025-03-17 20:03:36,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:03:36,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:03:36,437 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:03:36,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:03:36,513 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:03:36,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36 WrapperNode [2025-03-17 20:03:36,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:03:36,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:03:36,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:03:36,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:03:36,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,584 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 654 [2025-03-17 20:03:36,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:03:36,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:03:36,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:03:36,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:03:36,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,625 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-17 20:03:36,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:03:36,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:03:36,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:03:36,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:03:36,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (1/1) ... [2025-03-17 20:03:36,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:36,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:36,698 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-17 20:03:36,705 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-17 20:03:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:03:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:03:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:03:36,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:03:36,780 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:03:36,782 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:03:37,446 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-17 20:03:37,446 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:03:37,458 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:03:37,458 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:03:37,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:37 BoogieIcfgContainer [2025-03-17 20:03:37,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:03:37,461 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:03:37,461 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:03:37,465 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:03:37,465 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:37,465 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:03:36" (1/3) ... [2025-03-17 20:03:37,466 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6105ca7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:03:37, skipping insertion in model container [2025-03-17 20:03:37,466 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:37,467 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:36" (2/3) ... [2025-03-17 20:03:37,467 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6105ca7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:03:37, skipping insertion in model container [2025-03-17 20:03:37,467 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:37,467 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:37" (3/3) ... [2025-03-17 20:03:37,468 INFO L363 chiAutomizerObserver]: Analyzing ICFG Problem01_label05.c [2025-03-17 20:03:37,505 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:03:37,505 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:03:37,505 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:03:37,505 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:03:37,505 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:03:37,506 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:03:37,506 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:03:37,506 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:03:37,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 135 states, 134 states have (on average 1.962686567164179) internal successors, (263), 134 states have internal predecessors, (263), 0 states have call successors, (0), 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-17 20:03:37,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 131 [2025-03-17 20:03:37,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:37,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:37,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:03:37,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:03:37,532 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:03:37,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 135 states, 134 states have (on average 1.962686567164179) internal successors, (263), 134 states have internal predecessors, (263), 0 states have call successors, (0), 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-17 20:03:37,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 131 [2025-03-17 20:03:37,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:37,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:37,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:03:37,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:03:37,542 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-17 20:03:37,542 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-17 20:03:37,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:37,546 INFO L85 PathProgramCache]: Analyzing trace with hash 362, now seen corresponding path program 1 times [2025-03-17 20:03:37,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:37,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199589968] [2025-03-17 20:03:37,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:37,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:37,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:03:37,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:03:37,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:37,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:37,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:37,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:03:37,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:03:37,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:37,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:37,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 11043906, now seen corresponding path program 1 times [2025-03-17 20:03:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72960813] [2025-03-17 20:03:37,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:37,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:37,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:37,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:37,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:37,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:37,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:37,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:37,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:37,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:37,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:37,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash 344434987, now seen corresponding path program 1 times [2025-03-17 20:03:37,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:37,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886070549] [2025-03-17 20:03:37,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:37,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:37,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:37,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:37,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:37,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:37,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:37,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:37,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:37,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:37,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:37,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:37,904 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:37,905 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:37,905 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:37,905 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:37,905 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:37,905 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:37,906 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:37,906 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:37,906 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label05.c_Iteration1_Loop [2025-03-17 20:03:37,906 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:37,909 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:37,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:37,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,046 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:38,046 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:38,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,049 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-17 20:03:38,051 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-17 20:03:38,052 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,066 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,066 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-17 20:03:38,072 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-17 20:03:38,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,075 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-17 20:03:38,075 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-17 20:03:38,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,091 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,091 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:38,097 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-17 20:03:38,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,100 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-17 20:03:38,102 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-17 20:03:38,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,117 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,117 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=1} Honda state: {~a17~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:38,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 20:03:38,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,128 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-17 20:03:38,130 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-17 20:03:38,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,151 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,151 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a16~0=5} Honda state: {~a16~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:38,157 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-17 20:03:38,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,160 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-17 20:03:38,161 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-17 20:03:38,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,173 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,173 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-17 20:03:38,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-17 20:03:38,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,180 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-17 20:03:38,181 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-17 20:03:38,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,197 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,197 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-17 20:03:38,203 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-17 20:03:38,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,205 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-17 20:03:38,206 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-17 20:03:38,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,219 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,219 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-17 20:03:38,225 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-17 20:03:38,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,228 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-17 20:03:38,230 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-17 20:03:38,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,242 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,242 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-17 20:03:38,248 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-17 20:03:38,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,251 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-17 20:03:38,252 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-17 20:03:38,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,271 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,272 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a7~0=4} Honda state: {~a7~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:38,277 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-17 20:03:38,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,280 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-17 20:03:38,280 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-17 20:03:38,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,294 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,294 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:38,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:38,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,302 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-17 20:03:38,303 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-17 20:03:38,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,318 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:38,318 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=15} Honda state: {~a8~0=15} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:38,324 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-17 20:03:38,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,326 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-17 20:03:38,327 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-17 20:03:38,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:38,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:38,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,349 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-17 20:03:38,350 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-17 20:03:38,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:38,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:38,363 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:38,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:38,370 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:38,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:38,370 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:38,370 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:38,370 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:38,370 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,370 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:38,370 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:38,370 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label05.c_Iteration1_Loop [2025-03-17 20:03:38,370 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:38,370 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:38,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:38,495 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:38,497 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:38,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,501 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-17 20:03:38,503 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-17 20:03:38,504 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-17 20:03:38,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:38,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:38,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,530 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-17 20:03:38,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,532 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-17 20:03:38,534 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-17 20:03:38,536 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-17 20:03:38,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:38,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:38,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,557 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-17 20:03:38,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,560 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-17 20:03:38,561 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-17 20:03:38,563 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-17 20:03:38,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,573 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 20:03:38,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,575 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 20:03:38,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,584 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-17 20:03:38,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,586 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-17 20:03:38,588 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-17 20:03:38,589 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-17 20:03:38,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:38,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:38,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:38,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,612 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-17 20:03:38,614 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-17 20:03:38,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-17 20:03:38,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:38,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:38,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,635 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-17 20:03:38,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,638 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-17 20:03:38,639 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-17 20:03:38,640 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-17 20:03:38,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:38,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:38,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:38,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,662 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-17 20:03:38,663 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-17 20:03:38,665 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-17 20:03:38,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:38,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:38,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:38,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,686 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-17 20:03:38,687 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-17 20:03:38,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:38,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,699 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 20:03:38,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,700 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 20:03:38,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:38,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,709 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-17 20:03:38,709 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-17 20:03:38,712 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-17 20:03:38,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:38,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:38,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,725 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,731 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-17 20:03:38,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,732 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-17 20:03:38,733 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-17 20:03:38,734 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-17 20:03:38,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:38,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:38,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 20:03:38,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,752 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-17 20:03:38,753 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-17 20:03:38,754 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-17 20:03:38,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:38,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:38,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:38,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 20:03:38,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,774 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-17 20:03:38,775 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-17 20:03:38,777 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-17 20:03:38,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:38,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:38,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:38,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:38,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:38,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:38,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:38,793 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:38,795 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:38,797 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:03:38,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:38,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:38,801 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-17 20:03:38,803 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-17 20:03:38,804 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:38,804 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:38,804 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:38,805 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a20~0) = 1*~a20~0 Supporting invariants [] [2025-03-17 20:03:38,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 20:03:38,813 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:38,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:38,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:03:38,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:03:38,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:38,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:38,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:38,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:38,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:38,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:38,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:38,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:38,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:38,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:38,883 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-17 20:03:38,905 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-17 20:03:38,908 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 135 states, 134 states have (on average 1.962686567164179) internal successors, (263), 134 states have internal predecessors, (263), 0 states have call successors, (0), 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.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:39,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:39,331 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 135 states, 134 states have (on average 1.962686567164179) internal successors, (263), 134 states have internal predecessors, (263), 0 states have call successors, (0), 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.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 541 states and 954 transitions. Complement of second has 6 states. [2025-03-17 20:03:39,332 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-17 20:03:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2025-03-17 20:03:39,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 498 transitions. Stem has 1 letters. Loop has 4 letters. [2025-03-17 20:03:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 498 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 20:03:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:39,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 498 transitions. Stem has 1 letters. Loop has 8 letters. [2025-03-17 20:03:39,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:39,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 541 states and 954 transitions. [2025-03-17 20:03:39,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 262 [2025-03-17 20:03:39,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 541 states to 398 states and 618 transitions. [2025-03-17 20:03:39,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 264 [2025-03-17 20:03:39,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2025-03-17 20:03:39,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 398 states and 618 transitions. [2025-03-17 20:03:39,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:39,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 398 states and 618 transitions. [2025-03-17 20:03:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states and 618 transitions. [2025-03-17 20:03:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2025-03-17 20:03:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 396 states have (on average 1.5555555555555556) internal successors, (616), 395 states have internal predecessors, (616), 0 states have call successors, (0), 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-17 20:03:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 616 transitions. [2025-03-17 20:03:39,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 396 states and 616 transitions. [2025-03-17 20:03:39,435 INFO L432 stractBuchiCegarLoop]: Abstraction has 396 states and 616 transitions. [2025-03-17 20:03:39,435 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:03:39,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 616 transitions. [2025-03-17 20:03:39,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 262 [2025-03-17 20:03:39,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:39,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:39,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:03:39,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:39,464 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-17 20:03:39,464 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-17 20:03:39,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash 11551, now seen corresponding path program 1 times [2025-03-17 20:03:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:39,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346558588] [2025-03-17 20:03:39,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:39,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:39,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:39,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:39,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:39,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:39,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:39,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:39,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:39,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:39,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:39,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:39,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1750587602, now seen corresponding path program 1 times [2025-03-17 20:03:39,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:39,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190461167] [2025-03-17 20:03:39,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:39,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:39,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:39,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:39,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:39,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:39,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:39,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:39,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:39,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:39,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:39,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:39,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash 698240500, now seen corresponding path program 1 times [2025-03-17 20:03:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:39,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829991469] [2025-03-17 20:03:39,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:39,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:39,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:39,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:39,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:39,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:39,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:39,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:39,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:39,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:39,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:39,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:39,733 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:39,733 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:39,733 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:39,733 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:39,733 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:39,733 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:39,733 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:39,733 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:39,733 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label05.c_Iteration2_Loop [2025-03-17 20:03:39,733 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:39,733 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:39,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:39,882 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:39,882 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:39,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:39,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:39,886 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-17 20:03:39,891 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-17 20:03:39,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:39,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:39,906 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:39,907 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-17 20:03:39,913 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-17 20:03:39,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:39,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:39,915 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-17 20:03:39,920 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-17 20:03:39,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:39,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:39,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:39,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:39,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:39,954 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-17 20:03:39,956 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-17 20:03:39,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:39,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:39,984 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:39,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-17 20:03:39,989 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:39,989 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:39,989 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:39,989 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:39,989 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:39,989 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:39,989 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:39,989 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:39,989 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label05.c_Iteration2_Loop [2025-03-17 20:03:39,989 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:39,989 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:39,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:40,215 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:40,215 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:40,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,218 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-17 20:03:40,227 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-17 20:03:40,227 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-17 20:03:40,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:40,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:40,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:40,247 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 20:03:40,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:40,250 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 20:03:40,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:40,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:40,299 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-17 20:03:40,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,301 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-17 20:03:40,303 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-17 20:03:40,307 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-17 20:03:40,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:40,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:40,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:40,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:40,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:40,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:40,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:40,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:40,366 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-17 20:03:40,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,372 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-17 20:03:40,412 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-17 20:03:40,413 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-17 20:03:40,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:40,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:40,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:40,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:40,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:40,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:40,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:40,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:40,510 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-17 20:03:40,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,513 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-17 20:03:40,515 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-17 20:03:40,516 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-17 20:03:40,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:40,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:40,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:40,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:40,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:40,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:40,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:40,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:40,578 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-17 20:03:40,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,583 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-17 20:03:40,584 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-17 20:03:40,586 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-17 20:03:40,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:40,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:40,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:40,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:40,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:40,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:40,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:40,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:40,604 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-17 20:03:40,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,607 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-17 20:03:40,609 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-17 20:03:40,611 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-17 20:03:40,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:40,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:40,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:40,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:40,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:40,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:40,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:40,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:40,641 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-17 20:03:40,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,645 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-17 20:03:40,647 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-17 20:03:40,648 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-17 20:03:40,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:40,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:40,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:40,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:40,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:40,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:40,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:40,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:40,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:40,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,671 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-17 20:03:40,705 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-17 20:03:40,709 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-17 20:03:40,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:40,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:40,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:40,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:40,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:40,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:40,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:40,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:40,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:40,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,760 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-17 20:03:40,762 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-17 20:03:40,766 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-17 20:03:40,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:40,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:40,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:40,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:40,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:40,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:40,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:40,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:40,792 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-17 20:03:40,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,794 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-17 20:03:40,803 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-17 20:03:40,804 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-17 20:03:40,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:40,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:40,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:40,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:40,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:40,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:40,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:40,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:40,832 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:40,832 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:03:40,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:40,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:40,841 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-17 20:03:40,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:40,846 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:40,846 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:40,846 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a8~0) = 1*~a8~0 Supporting invariants [] [2025-03-17 20:03:40,852 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-17 20:03:40,853 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-17 20:03:40,856 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:40,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:40,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:40,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:40,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:40,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:40,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:40,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:40,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:40,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:40,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:40,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:40,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:40,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:40,946 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-17 20:03:40,946 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-17 20:03:40,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 396 states and 616 transitions. cyclomatic complexity: 223 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:41,529 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 396 states and 616 transitions. cyclomatic complexity: 223. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1324 states and 1973 transitions. Complement of second has 6 states. [2025-03-17 20:03:41,532 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-17 20:03:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2025-03-17 20:03:41,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 506 transitions. Stem has 2 letters. Loop has 7 letters. [2025-03-17 20:03:41,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:41,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 506 transitions. Stem has 9 letters. Loop has 7 letters. [2025-03-17 20:03:41,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:41,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 506 transitions. Stem has 2 letters. Loop has 14 letters. [2025-03-17 20:03:41,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:41,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1324 states and 1973 transitions. [2025-03-17 20:03:41,579 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 524 [2025-03-17 20:03:41,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1324 states to 1193 states and 1654 transitions. [2025-03-17 20:03:41,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 528 [2025-03-17 20:03:41,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 531 [2025-03-17 20:03:41,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1193 states and 1654 transitions. [2025-03-17 20:03:41,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:41,595 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1193 states and 1654 transitions. [2025-03-17 20:03:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states and 1654 transitions. [2025-03-17 20:03:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1190. [2025-03-17 20:03:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1190 states have (on average 1.3873949579831932) internal successors, (1651), 1189 states have internal predecessors, (1651), 0 states have call successors, (0), 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-17 20:03:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1651 transitions. [2025-03-17 20:03:41,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1190 states and 1651 transitions. [2025-03-17 20:03:41,677 INFO L432 stractBuchiCegarLoop]: Abstraction has 1190 states and 1651 transitions. [2025-03-17 20:03:41,677 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:03:41,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1190 states and 1651 transitions. [2025-03-17 20:03:41,688 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 524 [2025-03-17 20:03:41,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:41,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:41,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:03:41,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:41,689 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-17 20:03:41,689 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-17 20:03:41,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash 358409, now seen corresponding path program 1 times [2025-03-17 20:03:41,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:41,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972938764] [2025-03-17 20:03:41,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:41,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:41,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:41,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:41,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:41,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:41,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:41,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:41,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:41,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:41,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:41,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 946389143, now seen corresponding path program 1 times [2025-03-17 20:03:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377563613] [2025-03-17 20:03:41,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:41,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:41,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:41,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:41,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:41,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:41,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:41,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:41,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:41,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:41,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:41,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:41,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:41,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2102776207, now seen corresponding path program 1 times [2025-03-17 20:03:41,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:41,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107221175] [2025-03-17 20:03:41,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:41,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:03:41,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:03:41,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:41,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:41,868 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-17 20:03:41,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:41,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107221175] [2025-03-17 20:03:41,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107221175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:41,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:41,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:03:41,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943636679] [2025-03-17 20:03:41,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:41,988 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:41,989 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:41,989 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:41,989 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:41,989 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:41,989 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:41,989 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:41,989 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:41,989 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label05.c_Iteration3_Loop [2025-03-17 20:03:41,989 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:41,989 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:42,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-17 20:03:42,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,150 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:42,153 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:42,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,156 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-17 20:03:42,157 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-17 20:03:42,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:42,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:42,169 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:42,169 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:42,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:42,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,178 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-17 20:03:42,179 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-17 20:03:42,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:42,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:42,193 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:42,193 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=15} Honda state: {~a8~0=15} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:42,199 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-17 20:03:42,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,201 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-17 20:03:42,205 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-17 20:03:42,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:42,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:42,218 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:42,219 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-17 20:03:42,224 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-17 20:03:42,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,227 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-17 20:03:42,228 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-17 20:03:42,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:42,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:42,242 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:42,242 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-17 20:03:42,248 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-17 20:03:42,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,252 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-17 20:03:42,253 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-17 20:03:42,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:42,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:42,267 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:42,267 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:42,274 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-17 20:03:42,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,277 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-17 20:03:42,279 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-17 20:03:42,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:42,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:42,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-17 20:03:42,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,299 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-17 20:03:42,301 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-17 20:03:42,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:42,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:42,314 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:42,320 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-17 20:03:42,320 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:42,320 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:42,320 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:42,320 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:42,320 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:42,320 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,320 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:42,320 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:42,320 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label05.c_Iteration3_Loop [2025-03-17 20:03:42,320 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:42,320 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:42,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:42,465 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:42,466 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:42,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,468 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-17 20:03:42,468 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-17 20:03:42,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:42,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:42,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:42,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:42,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:42,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:42,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:42,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:42,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:42,487 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-17 20:03:42,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,489 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-17 20:03:42,489 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-17 20:03:42,491 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-17 20:03:42,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:42,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:42,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:42,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:42,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:42,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:42,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:42,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:42,507 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-17 20:03:42,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,509 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-17 20:03:42,511 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-17 20:03:42,512 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-17 20:03:42,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:42,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:42,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:42,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:42,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:42,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:42,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:42,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:42,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 20:03:42,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,533 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-17 20:03:42,534 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-17 20:03:42,535 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-17 20:03:42,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:42,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:42,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:42,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:42,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:42,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:42,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:42,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:42,553 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-17 20:03:42,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,555 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-17 20:03:42,556 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-17 20:03:42,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:42,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:42,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:42,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:42,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:42,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:42,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:42,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:42,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:42,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:42,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,578 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-17 20:03:42,579 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-17 20:03:42,581 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-17 20:03:42,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:42,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:42,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:42,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:42,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:42,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:42,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:42,593 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:42,595 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 20:03:42,595 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:42,597 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-17 20:03:42,598 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-17 20:03:42,599 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:42,599 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:42,599 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:42,599 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a17~0) = 1*~a17~0 Supporting invariants [] [2025-03-17 20:03:42,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:42,606 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:42,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:42,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:42,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:42,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:42,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:42,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:42,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:42,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:42,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:42,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:42,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:42,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:42,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:42,659 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-17 20:03:42,660 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-17 20:03:42,660 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1190 states and 1651 transitions. cyclomatic complexity: 470 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:43,028 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1190 states and 1651 transitions. cyclomatic complexity: 470. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3983 states and 5228 transitions. Complement of second has 6 states. [2025-03-17 20:03:43,029 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-17 20:03:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2025-03-17 20:03:43,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 484 transitions. Stem has 3 letters. Loop has 9 letters. [2025-03-17 20:03:43,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:43,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 484 transitions. Stem has 12 letters. Loop has 9 letters. [2025-03-17 20:03:43,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:43,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 484 transitions. Stem has 3 letters. Loop has 18 letters. [2025-03-17 20:03:43,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:43,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3983 states and 5228 transitions. [2025-03-17 20:03:43,057 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1048 [2025-03-17 20:03:43,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3983 states to 3852 states and 4909 transitions. [2025-03-17 20:03:43,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1058 [2025-03-17 20:03:43,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1063 [2025-03-17 20:03:43,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3852 states and 4909 transitions. [2025-03-17 20:03:43,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:43,078 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3852 states and 4909 transitions. [2025-03-17 20:03:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states and 4909 transitions. [2025-03-17 20:03:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3845. [2025-03-17 20:03:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3845 states have (on average 1.2749024707412224) internal successors, (4902), 3844 states have internal predecessors, (4902), 0 states have call successors, (0), 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-17 20:03:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 4902 transitions. [2025-03-17 20:03:43,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3845 states and 4902 transitions. [2025-03-17 20:03:43,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:43,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:43,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:43,139 INFO L87 Difference]: Start difference. First operand 3845 states and 4902 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:43,538 INFO L93 Difference]: Finished difference Result 7267 states and 8745 transitions. [2025-03-17 20:03:43,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7267 states and 8745 transitions. [2025-03-17 20:03:43,574 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2096 [2025-03-17 20:03:43,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7267 states to 7267 states and 8745 transitions. [2025-03-17 20:03:43,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2106 [2025-03-17 20:03:43,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2106 [2025-03-17 20:03:43,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7267 states and 8745 transitions. [2025-03-17 20:03:43,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:43,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7267 states and 8745 transitions. [2025-03-17 20:03:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7267 states and 8745 transitions. [2025-03-17 20:03:43,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7267 to 7267. [2025-03-17 20:03:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7267 states, 7267 states have (on average 1.2033851658180816) internal successors, (8745), 7266 states have internal predecessors, (8745), 0 states have call successors, (0), 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-17 20:03:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7267 states to 7267 states and 8745 transitions. [2025-03-17 20:03:43,743 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7267 states and 8745 transitions. [2025-03-17 20:03:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:43,746 INFO L432 stractBuchiCegarLoop]: Abstraction has 7267 states and 8745 transitions. [2025-03-17 20:03:43,746 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:03:43,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7267 states and 8745 transitions. [2025-03-17 20:03:43,764 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2096 [2025-03-17 20:03:43,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:43,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:43,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:03:43,765 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-17 20:03:43,765 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-17 20:03:43,765 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-17 20:03:43,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash 11111002, now seen corresponding path program 1 times [2025-03-17 20:03:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456970810] [2025-03-17 20:03:43,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:43,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:43,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:43,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:43,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:43,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:43,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:43,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:43,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:43,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:43,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:43,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash -934938176, now seen corresponding path program 1 times [2025-03-17 20:03:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:43,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263129216] [2025-03-17 20:03:43,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:43,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:43,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 20:03:43,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 20:03:43,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:43,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:43,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:43,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 20:03:43,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 20:03:43,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:43,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:43,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:43,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1629841305, now seen corresponding path program 1 times [2025-03-17 20:03:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:43,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274163911] [2025-03-17 20:03:43,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:43,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:43,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 20:03:43,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 20:03:43,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:43,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:43,974 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-17 20:03:43,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:43,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274163911] [2025-03-17 20:03:43,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274163911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:43,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:43,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:03:43,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428785808] [2025-03-17 20:03:43,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:44,337 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:44,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:44,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:44,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:44,338 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:44,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:44,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:44,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:44,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label05.c_Iteration4_Loop [2025-03-17 20:03:44,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:44,338 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:44,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,497 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:44,497 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:44,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:44,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:44,500 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-17 20:03:44,502 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-17 20:03:44,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:44,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:44,515 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:44,515 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:44,521 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-17 20:03:44,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:44,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:44,523 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-17 20:03:44,524 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-17 20:03:44,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:44,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:44,544 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:44,544 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-17 20:03:44,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-17 20:03:44,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:44,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:44,551 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-17 20:03:44,552 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-17 20:03:44,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:44,553 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:44,564 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:44,565 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=13} Honda state: {~a8~0=13} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:44,571 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-17 20:03:44,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:44,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:44,573 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-17 20:03:44,639 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-17 20:03:44,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:44,640 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:44,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:44,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:44,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:44,663 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-17 20:03:44,664 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-17 20:03:44,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:44,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:44,676 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:44,683 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-17 20:03:44,683 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:44,683 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:44,683 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:44,683 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:44,683 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:44,683 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:44,683 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:44,683 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:44,683 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label05.c_Iteration4_Loop [2025-03-17 20:03:44,683 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:44,683 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:44,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:44,937 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:44,937 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:44,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:44,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:44,941 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-17 20:03:44,942 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-17 20:03:44,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-17 20:03:44,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:44,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:44,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:44,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:44,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:44,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:44,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:44,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:44,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:44,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:44,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:44,969 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-17 20:03:44,971 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-17 20:03:44,972 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-17 20:03:44,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:44,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:44,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:44,985 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-03-17 20:03:44,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:44,989 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-17 20:03:44,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:45,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:45,204 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-17 20:03:45,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:45,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:45,208 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-17 20:03:45,210 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-17 20:03:45,214 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-17 20:03:45,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:45,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:45,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:45,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:45,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:45,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:45,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:45,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:45,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:45,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:45,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:45,242 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-17 20:03:45,243 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-17 20:03:45,245 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-17 20:03:45,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:45,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:45,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:45,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:45,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:45,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:45,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:45,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:45,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:45,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:45,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:45,291 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-17 20:03:45,294 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-17 20:03:45,295 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-17 20:03:45,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:45,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:45,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:45,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:45,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:45,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:45,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:45,337 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:45,340 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 20:03:45,340 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:45,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:45,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:45,342 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-17 20:03:45,344 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-17 20:03:45,345 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:45,345 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:45,345 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:45,345 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a7~0) = 1*~a7~0 Supporting invariants [] [2025-03-17 20:03:45,352 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-17 20:03:45,352 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:45,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:45,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:45,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:45,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:45,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:45,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:45,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:45,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 20:03:45,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 20:03:45,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:45,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:45,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:45,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:45,619 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-17 20:03:45,620 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-17 20:03:45,620 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7267 states and 8745 transitions. cyclomatic complexity: 1515 Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-17 20:03:46,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7267 states and 8745 transitions. cyclomatic complexity: 1515. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 24256 states and 28317 transitions. Complement of second has 5 states. [2025-03-17 20:03:46,268 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-17 20:03:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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-17 20:03:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-17 20:03:46,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 4 letters. Loop has 68 letters. [2025-03-17 20:03:46,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:46,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 72 letters. Loop has 68 letters. [2025-03-17 20:03:46,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:46,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 4 letters. Loop has 136 letters. [2025-03-17 20:03:46,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:46,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24256 states and 28317 transitions. [2025-03-17 20:03:46,406 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 4192 [2025-03-17 20:03:46,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24256 states to 24256 states and 28317 transitions. [2025-03-17 20:03:46,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4230 [2025-03-17 20:03:46,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4242 [2025-03-17 20:03:46,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24256 states and 28317 transitions. [2025-03-17 20:03:46,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:46,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24256 states and 28317 transitions. [2025-03-17 20:03:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24256 states and 28317 transitions. [2025-03-17 20:03:46,657 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-17 20:03:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24256 to 24233. [2025-03-17 20:03:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24233 states, 24233 states have (on average 1.167581397268188) internal successors, (28294), 24232 states have internal predecessors, (28294), 0 states have call successors, (0), 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-17 20:03:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24233 states to 24233 states and 28294 transitions. [2025-03-17 20:03:46,883 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24233 states and 28294 transitions. [2025-03-17 20:03:46,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:46,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:46,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:46,883 INFO L87 Difference]: Start difference. First operand 24233 states and 28294 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 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-17 20:03:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:47,340 INFO L93 Difference]: Finished difference Result 48031 states and 54852 transitions. [2025-03-17 20:03:47,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48031 states and 54852 transitions. [2025-03-17 20:03:47,507 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 8384 [2025-03-17 20:03:47,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48031 states to 45130 states and 51546 transitions. [2025-03-17 20:03:47,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8440 [2025-03-17 20:03:47,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8440 [2025-03-17 20:03:47,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45130 states and 51546 transitions. [2025-03-17 20:03:47,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:47,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45130 states and 51546 transitions. [2025-03-17 20:03:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45130 states and 51546 transitions. [2025-03-17 20:03:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45130 to 41165. [2025-03-17 20:03:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41165 states, 41165 states have (on average 1.1480626746022107) internal successors, (47260), 41164 states have internal predecessors, (47260), 0 states have call successors, (0), 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-17 20:03:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41165 states to 41165 states and 47260 transitions. [2025-03-17 20:03:48,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41165 states and 47260 transitions. [2025-03-17 20:03:48,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:48,156 INFO L432 stractBuchiCegarLoop]: Abstraction has 41165 states and 47260 transitions. [2025-03-17 20:03:48,156 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:03:48,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41165 states and 47260 transitions. [2025-03-17 20:03:48,207 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-17 20:03:48,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:48,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:48,208 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:03:48,209 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-17 20:03:48,209 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-17 20:03:48,209 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-17 20:03:48,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash 11111002, now seen corresponding path program 2 times [2025-03-17 20:03:48,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:48,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158591342] [2025-03-17 20:03:48,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:03:48,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:48,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:48,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:48,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:03:48,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:48,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:48,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:48,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:48,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:48,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:48,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:48,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1817668742, now seen corresponding path program 1 times [2025-03-17 20:03:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:48,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736760256] [2025-03-17 20:03:48,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:48,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 20:03:48,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 20:03:48,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:48,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:48,255 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:48,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 20:03:48,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 20:03:48,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:48,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:48,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:48,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:48,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1569020019, now seen corresponding path program 1 times [2025-03-17 20:03:48,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:48,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236275758] [2025-03-17 20:03:48,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:48,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:48,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 20:03:48,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 20:03:48,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:48,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:49,422 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-17 20:03:49,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:49,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236275758] [2025-03-17 20:03:49,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236275758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:49,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:49,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 20:03:49,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150022486] [2025-03-17 20:03:49,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:53,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 20:03:53,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 20:03:53,975 INFO L87 Difference]: Start difference. First operand 41165 states and 47260 transitions. cyclomatic complexity: 6257 Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 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-17 20:03:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:54,722 INFO L93 Difference]: Finished difference Result 42261 states and 48368 transitions. [2025-03-17 20:03:54,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42261 states and 48368 transitions. [2025-03-17 20:03:54,816 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-17 20:03:54,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42261 states to 41569 states and 47676 transitions. [2025-03-17 20:03:54,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7383 [2025-03-17 20:03:54,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7383 [2025-03-17 20:03:54,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41569 states and 47676 transitions. [2025-03-17 20:03:54,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:54,910 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41569 states and 47676 transitions. [2025-03-17 20:03:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41569 states and 47676 transitions. [2025-03-17 20:03:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41569 to 41569. [2025-03-17 20:03:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41569 states, 41569 states have (on average 1.1469123625778825) internal successors, (47676), 41568 states have internal predecessors, (47676), 0 states have call successors, (0), 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-17 20:03:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41569 states to 41569 states and 47676 transitions. [2025-03-17 20:03:55,424 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41569 states and 47676 transitions. [2025-03-17 20:03:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 20:03:55,426 INFO L432 stractBuchiCegarLoop]: Abstraction has 41569 states and 47676 transitions. [2025-03-17 20:03:55,426 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:03:55,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41569 states and 47676 transitions. [2025-03-17 20:03:55,490 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-17 20:03:55,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:55,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:55,491 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:55,491 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-17 20:03:55,491 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-17 20:03:55,491 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-17 20:03:55,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash 344434987, now seen corresponding path program 2 times [2025-03-17 20:03:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:55,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033886789] [2025-03-17 20:03:55,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:03:55,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:55,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:55,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:55,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:03:55,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:55,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:55,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:55,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:55,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:55,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:55,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:55,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:55,518 INFO L85 PathProgramCache]: Analyzing trace with hash -750403322, now seen corresponding path program 1 times [2025-03-17 20:03:55,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887442829] [2025-03-17 20:03:55,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:55,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 20:03:55,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 20:03:55,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:55,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:55,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:55,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 20:03:55,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 20:03:55,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:55,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:55,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:55,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash 41783452, now seen corresponding path program 1 times [2025-03-17 20:03:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:55,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807041727] [2025-03-17 20:03:55,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:55,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 20:03:55,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 20:03:55,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:55,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:55,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:55,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 20:03:55,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 20:03:55,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:55,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:55,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:56,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:56,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:56,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:56,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:56,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:56,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:56,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:56,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:56,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:56,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:03:56 BoogieIcfgContainer [2025-03-17 20:03:56,664 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:03:56,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:03:56,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:03:56,665 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:03:56,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:37" (3/4) ... [2025-03-17 20:03:56,666 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 20:03:56,709 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 20:03:56,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:03:56,711 INFO L158 Benchmark]: Toolchain (without parser) took 20524.81ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 103.8MB in the beginning and 616.7MB in the end (delta: -512.9MB). Peak memory consumption was 437.1MB. Max. memory is 16.1GB. [2025-03-17 20:03:56,711 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:56,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.08ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 75.0MB in the end (delta: 28.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 20:03:56,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.62ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 69.3MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:56,712 INFO L158 Benchmark]: Boogie Preprocessor took 80.37ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 65.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:03:56,712 INFO L158 Benchmark]: IcfgBuilder took 791.95ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 57.7MB in the end (delta: 8.0MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2025-03-17 20:03:56,712 INFO L158 Benchmark]: BuchiAutomizer took 19202.68ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 56.9MB in the beginning and 621.1MB in the end (delta: -564.1MB). Peak memory consumption was 387.3MB. Max. memory is 16.1GB. [2025-03-17 20:03:56,713 INFO L158 Benchmark]: Witness Printer took 44.91ms. Allocated memory is still 1.1GB. Free memory was 621.1MB in the beginning and 616.7MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:56,713 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.08ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 75.0MB in the end (delta: 28.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.62ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 69.3MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.37ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 65.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 791.95ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 57.7MB in the end (delta: 8.0MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 19202.68ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 56.9MB in the beginning and 621.1MB in the end (delta: -564.1MB). Peak memory consumption was 387.3MB. Max. memory is 16.1GB. * Witness Printer took 44.91ms. Allocated memory is still 1.1GB. Free memory was 621.1MB in the beginning and 616.7MB in the end (delta: 4.4MB). 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 41569 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 12.0s. Construction of modules took 2.1s. Büchi inclusion checks took 3.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 1.7s AutomataMinimizationTime, 7 MinimizatonAttempts, 4000 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.8s 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, 1042 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1038 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3387 IncrementalHoareTripleChecker+Invalid, 3573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 184 mSDtfsCounter, 3387 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: 231ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s 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; [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; [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-17 20:03:56,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)