./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label56.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 7b93c3f7fecac47558d01f2a0c93696ea48f2ebbd5c30f43df88a8759c531651 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:48:26,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:48:26,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:48:26,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:48:26,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:48:26,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:48:26,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:48:26,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:48:26,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:48:26,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:48:26,564 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:48:26,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:48:26,565 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:48:26,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:48:26,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:48:26,566 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:48:26,566 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:48:26,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:48:26,566 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:48:26,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:48:26,566 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:48:26,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:48:26,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:48:26,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:48:26,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:48:26,566 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:48:26,566 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 -> 7b93c3f7fecac47558d01f2a0c93696ea48f2ebbd5c30f43df88a8759c531651 [2025-03-04 15:48:26,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:48:26,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:48:26,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:48:26,843 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:48:26,843 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:48:26,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2025-03-04 15:48:28,000 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b016558f/62fd81e54edd4e9586806f1eb050e57f/FLAG9fe96aace [2025-03-04 15:48:28,331 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:48:28,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2025-03-04 15:48:28,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b016558f/62fd81e54edd4e9586806f1eb050e57f/FLAG9fe96aace [2025-03-04 15:48:28,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b016558f/62fd81e54edd4e9586806f1eb050e57f [2025-03-04 15:48:28,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:48:28,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:48:28,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:48:28,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:48:28,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:48:28,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:28,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2751653f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28, skipping insertion in model container [2025-03-04 15:48:28,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:28,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:48:28,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:48:28,854 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:48:28,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:48:28,922 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:48:28,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28 WrapperNode [2025-03-04 15:48:28,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:48:28,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:48:28,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:48:28,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:48:28,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:28,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:28,967 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 654 [2025-03-04 15:48:28,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:48:28,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:48:28,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:48:28,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:48:28,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:28,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:28,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:28,990 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:48:28,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:28,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:29,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:29,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:29,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:29,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:29,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:48:29,021 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:48:29,021 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:48:29,021 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:48:29,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (1/1) ... [2025-03-04 15:48:29,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:29,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:29,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:29,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:48:29,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:48:29,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:48:29,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:48:29,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:48:29,123 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:48:29,125 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:48:29,794 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-04 15:48:29,794 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:48:29,808 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:48:29,809 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:48:29,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:48:29 BoogieIcfgContainer [2025-03-04 15:48:29,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:48:29,810 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:48:29,811 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:48:29,819 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:48:29,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:48:29,820 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:48:28" (1/3) ... [2025-03-04 15:48:29,820 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20d496e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:48:29, skipping insertion in model container [2025-03-04 15:48:29,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:48:29,821 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:48:28" (2/3) ... [2025-03-04 15:48:29,824 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20d496e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:48:29, skipping insertion in model container [2025-03-04 15:48:29,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:48:29,824 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:48:29" (3/3) ... [2025-03-04 15:48:29,825 INFO L363 chiAutomizerObserver]: Analyzing ICFG Problem01_label56.c [2025-03-04 15:48:29,863 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:48:29,864 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:48:29,864 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:48:29,864 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:48:29,864 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:48:29,864 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:48:29,864 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:48:29,864 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:48:29,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 198 states, 197 states have (on average 1.6548223350253808) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:29,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2025-03-04 15:48:29,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:29,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:29,896 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:48:29,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:48:29,896 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:48:29,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 198 states, 197 states have (on average 1.6548223350253808) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:29,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2025-03-04 15:48:29,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:29,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:29,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:48:29,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:48:29,912 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" [2025-03-04 15:48:29,912 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume (15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0;~a16~0 := 5;~a20~0 := 0;calculate_output_#res#1 := 24;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" [2025-03-04 15:48:29,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash 13568, now seen corresponding path program 1 times [2025-03-04 15:48:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:29,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498368008] [2025-03-04 15:48:29,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:29,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:29,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:48:29,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:48:29,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:29,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:29,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:29,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:48:29,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:48:29,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:29,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:30,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:30,005 INFO L85 PathProgramCache]: Analyzing trace with hash 12952452, now seen corresponding path program 1 times [2025-03-04 15:48:30,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:30,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946898244] [2025-03-04 15:48:30,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:30,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:30,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:30,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:30,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:30,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:30,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:30,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:30,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:30,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:30,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:30,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash -342540029, now seen corresponding path program 1 times [2025-03-04 15:48:30,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:30,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115243286] [2025-03-04 15:48:30,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:30,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:30,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:30,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:30,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:30,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:30,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:30,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:30,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:30,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:30,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:30,209 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:30,210 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:30,210 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:30,210 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:30,210 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:48:30,210 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,210 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:30,211 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:30,211 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label56.c_Iteration1_Loop [2025-03-04 15:48:30,212 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:30,212 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:30,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,355 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:30,356 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:48:30,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:48:30,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,376 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,376 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_~input#1=0} Honda state: {ULTIMATE.start_calculate_output_~input#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:48:30,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:48:30,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,408 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,408 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:30,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,417 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:48:30,451 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,451 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=1} Honda state: {~a17~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:30,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:48:30,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,481 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,482 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a16~0=5} Honda state: {~a16~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:30,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:48:30,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,505 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,505 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input#1=0} Honda state: {ULTIMATE.start_calculate_output_#in~input#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:30,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,513 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:48:30,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,527 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,527 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret7#1=0} Honda state: {ULTIMATE.start_main_#t~ret7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:30,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:48:30,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,549 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,549 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0#1=0} Honda state: {ULTIMATE.start_main_~input~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 15:48:30,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,556 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:48:30,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,568 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,569 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet6#1=0} Honda state: {ULTIMATE.start_main_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:48:30,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:48:30,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,596 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,596 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a7~0=4} Honda state: {~a7~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 15:48:30,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,603 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:48:30,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,617 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,617 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:48:30,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,624 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:48:30,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,637 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:30,637 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=15} Honda state: {~a8~0=15} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:30,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:48:30,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,644 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:48:30,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:30,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 15:48:30,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,665 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:48:30,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:48:30,667 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:30,681 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:48:30,689 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-04 15:48:30,689 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:30,689 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:30,689 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:30,689 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:30,689 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:48:30,689 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,689 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:30,689 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:30,689 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label56.c_Iteration1_Loop [2025-03-04 15:48:30,689 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:30,689 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:30,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:30,810 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:30,814 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:48:30,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,816 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:48:30,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:30,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:30,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:30,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:30,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:30,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:30,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:30,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:30,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:30,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:30,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,845 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:48:30,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:30,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:30,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:30,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:30,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:30,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:30,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:30,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:30,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:30,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:30,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,870 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:48:30,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:30,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:30,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:30,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:30,883 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:48:30,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:30,885 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:48:30,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:30,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:30,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 15:48:30,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,895 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:48:30,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:30,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:30,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:30,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:30,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:30,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:30,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:30,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:30,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:30,917 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-04 15:48:30,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,919 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:48:30,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:30,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:30,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:30,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:30,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:30,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:30,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:30,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:30,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:30,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:30,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,943 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 15:48:30,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:30,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:30,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:30,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:30,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:30,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:30,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:30,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:30,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:30,964 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-04 15:48:30,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,966 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 15:48:30,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:30,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:30,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:30,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:30,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:30,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:30,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:30,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:30,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:30,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 15:48:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:30,988 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:30,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 15:48:30,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:31,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:31,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:31,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:31,000 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:48:31,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:31,002 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:48:31,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:31,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:31,013 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-04 15:48:31,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:31,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:31,015 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:31,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:48:31,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:31,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:31,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:31,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:31,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:31,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:31,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:31,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:31,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:31,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 15:48:31,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:31,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:31,040 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:31,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:48:31,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:31,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:31,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:31,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:31,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:31,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:31,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:31,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:31,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:31,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:31,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:31,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:31,067 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:31,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:48:31,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:31,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:31,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:31,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:31,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:31,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:31,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:31,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:31,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:31,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:31,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:31,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:31,090 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:31,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 15:48:31,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:31,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:31,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:31,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:31,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:31,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:31,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:31,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:31,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:48:31,109 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:48:31,110 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:48:31,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:31,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:31,113 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:31,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 15:48:31,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:48:31,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:48:31,116 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:48:31,117 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a20~0) = 1*~a20~0 Supporting invariants [] [2025-03-04 15:48:31,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:31,124 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:48:31,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:31,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:48:31,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:48:31,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:31,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:31,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:48:31,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:31,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:31,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:31,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:31,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:31,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:48:31,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:48:31,232 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:48:31,234 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 198 states, 197 states have (on average 1.6548223350253808) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:31,691 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 198 states, 197 states have (on average 1.6548223350253808) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 788 states and 1201 transitions. Complement of second has 6 states. [2025-03-04 15:48:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:48:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2025-03-04 15:48:31,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 622 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-04 15:48:31,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:31,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 622 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-04 15:48:31,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:31,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 622 transitions. Stem has 2 letters. Loop has 8 letters. [2025-03-04 15:48:31,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:31,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 788 states and 1201 transitions. [2025-03-04 15:48:31,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 324 [2025-03-04 15:48:31,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 788 states to 461 states and 681 transitions. [2025-03-04 15:48:31,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2025-03-04 15:48:31,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2025-03-04 15:48:31,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 681 transitions. [2025-03-04 15:48:31,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:31,721 INFO L218 hiAutomatonCegarLoop]: Abstraction has 461 states and 681 transitions. [2025-03-04 15:48:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 681 transitions. [2025-03-04 15:48:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-03-04 15:48:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 459 states have (on average 1.4793028322440087) internal successors, (679), 458 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 679 transitions. [2025-03-04 15:48:31,767 INFO L240 hiAutomatonCegarLoop]: Abstraction has 459 states and 679 transitions. [2025-03-04 15:48:31,767 INFO L432 stractBuchiCegarLoop]: Abstraction has 459 states and 679 transitions. [2025-03-04 15:48:31,767 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:48:31,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 459 states and 679 transitions. [2025-03-04 15:48:31,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 324 [2025-03-04 15:48:31,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:31,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:31,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:48:31,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:48:31,769 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" [2025-03-04 15:48:31,770 INFO L754 eck$LassoCheckResult]: Loop: "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume 1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0;~a8~0 := 13;~a7~0 := 1;~a16~0 := 4;calculate_output_#res#1 := -1;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" [2025-03-04 15:48:31,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash 420999, now seen corresponding path program 1 times [2025-03-04 15:48:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:31,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193846481] [2025-03-04 15:48:31,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:31,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:48:31,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:48:31,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:31,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:31,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:31,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:48:31,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 15:48:31,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:48:31,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:31,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:31,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:31,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:31,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1519553970, now seen corresponding path program 1 times [2025-03-04 15:48:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:31,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837571336] [2025-03-04 15:48:31,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:31,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:48:31,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:48:31,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:31,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:31,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:31,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:48:31,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:48:31,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:31,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:31,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:31,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:31,842 INFO L85 PathProgramCache]: Analyzing trace with hash 292750088, now seen corresponding path program 1 times [2025-03-04 15:48:31,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:31,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309702593] [2025-03-04 15:48:31,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:31,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:48:31,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:48:31,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:31,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:31,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:31,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:48:31,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:48:31,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:31,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:31,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:31,978 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:31,978 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:31,978 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:31,978 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:31,978 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:48:31,978 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:31,978 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:31,978 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:31,978 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label56.c_Iteration2_Loop [2025-03-04 15:48:31,978 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:31,978 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:31,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:31,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:31,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:31,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:31,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:31,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:31,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:31,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:31,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:31,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,105 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:32,105 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:48:32,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,114 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 15:48:32,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:32,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:32,127 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:32,127 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res#1=0} Honda state: {ULTIMATE.start_calculate_output_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:32,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:32,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,136 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 15:48:32,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:32,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:32,162 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-04 15:48:32,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,164 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 15:48:32,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:48:32,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:32,196 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:48:32,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:32,200 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:32,200 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:32,200 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:32,200 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:32,200 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:48:32,201 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,201 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:32,201 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:32,201 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label56.c_Iteration2_Loop [2025-03-04 15:48:32,201 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:32,201 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:32,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:32,316 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:32,316 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:48:32,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,319 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 15:48:32,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:32,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:32,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:32,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:32,331 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:48:32,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:32,332 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:48:32,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:32,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:32,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:32,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,342 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 15:48:32,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:32,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:32,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:32,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:32,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:32,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:32,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:32,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:32,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:32,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:32,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,366 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 15:48:32,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:32,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:32,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:32,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:32,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:32,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:32,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:32,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:32,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:32,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:32,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,388 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 15:48:32,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:32,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:32,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:32,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:32,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:32,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:32,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:32,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:32,404 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:32,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 15:48:32,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,412 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 15:48:32,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:32,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:32,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:32,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:32,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:32,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:32,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:32,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:32,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:32,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:32,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,436 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:32,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 15:48:32,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:32,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:32,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:32,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:32,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:32,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:32,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:32,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:32,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:32,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,459 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 15:48:32,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:32,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:32,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:32,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:32,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:32,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:32,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:32,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:32,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:32,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 15:48:32,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,479 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 15:48:32,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:32,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:32,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:32,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:32,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:32,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:32,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:32,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:32,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:32,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-04 15:48:32,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,502 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 15:48:32,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:32,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:32,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:32,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:32,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:32,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:32,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:32,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:32,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:32,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-04 15:48:32,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,522 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 15:48:32,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:32,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:32,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:32,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:32,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:32,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:32,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:32,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:32,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:48:32,539 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:48:32,539 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:48:32,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:32,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:32,542 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:32,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 15:48:32,544 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:48:32,544 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:48:32,544 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:48:32,544 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a8~0) = 1*~a8~0 Supporting invariants [] [2025-03-04 15:48:32,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 15:48:32,551 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:48:32,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:32,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:48:32,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:48:32,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:32,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:32,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:48:32,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:32,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:48:32,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:48:32,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:32,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:32,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:48:32,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:48:32,597 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:48:32,598 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 459 states and 679 transitions. cyclomatic complexity: 223 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:32,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:32,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 459 states and 679 transitions. cyclomatic complexity: 223. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1571 states and 2220 transitions. Complement of second has 6 states. [2025-03-04 15:48:32,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:48:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2025-03-04 15:48:32,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 630 transitions. Stem has 3 letters. Loop has 7 letters. [2025-03-04 15:48:32,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:32,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 630 transitions. Stem has 10 letters. Loop has 7 letters. [2025-03-04 15:48:32,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:32,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 630 transitions. Stem has 3 letters. Loop has 14 letters. [2025-03-04 15:48:32,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:32,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1571 states and 2220 transitions. [2025-03-04 15:48:32,966 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 586 [2025-03-04 15:48:32,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1571 states to 1256 states and 1717 transitions. [2025-03-04 15:48:32,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 591 [2025-03-04 15:48:32,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2025-03-04 15:48:32,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1256 states and 1717 transitions. [2025-03-04 15:48:32,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:32,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1256 states and 1717 transitions. [2025-03-04 15:48:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states and 1717 transitions. [2025-03-04 15:48:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1253. [2025-03-04 15:48:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1253 states have (on average 1.3679169992019153) internal successors, (1714), 1252 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1714 transitions. [2025-03-04 15:48:33,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1253 states and 1714 transitions. [2025-03-04 15:48:33,027 INFO L432 stractBuchiCegarLoop]: Abstraction has 1253 states and 1714 transitions. [2025-03-04 15:48:33,027 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:48:33,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1253 states and 1714 transitions. [2025-03-04 15:48:33,032 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 586 [2025-03-04 15:48:33,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:33,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:33,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:48:33,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:48:33,033 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" [2025-03-04 15:48:33,034 INFO L754 eck$LassoCheckResult]: Loop: "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume (1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0;~a17~0 := 0;calculate_output_#res#1 := 26;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" [2025-03-04 15:48:33,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:33,034 INFO L85 PathProgramCache]: Analyzing trace with hash 13051359, now seen corresponding path program 1 times [2025-03-04 15:48:33,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:33,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038795487] [2025-03-04 15:48:33,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:33,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:33,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:33,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:33,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:33,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:33,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:33,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:33,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:33,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:33,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:33,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:33,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2036778729, now seen corresponding path program 1 times [2025-03-04 15:48:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:33,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475894423] [2025-03-04 15:48:33,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:33,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:48:33,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:48:33,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:33,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:33,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:33,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:48:33,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:48:33,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:33,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:33,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:33,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:33,086 INFO L85 PathProgramCache]: Analyzing trace with hash -356791047, now seen corresponding path program 1 times [2025-03-04 15:48:33,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:33,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729366744] [2025-03-04 15:48:33,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:33,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:33,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:48:33,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:48:33,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:33,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:48:33,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:48:33,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729366744] [2025-03-04 15:48:33,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729366744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:48:33,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:48:33,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:48:33,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806772651] [2025-03-04 15:48:33,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:48:33,312 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:33,312 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:33,312 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:33,312 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:33,312 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:48:33,312 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,312 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:33,312 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:33,312 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label56.c_Iteration3_Loop [2025-03-04 15:48:33,312 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:33,312 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:33,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,458 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:33,458 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:48:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,463 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 15:48:33,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:33,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:33,476 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:33,476 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:33,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:33,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,484 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 15:48:33,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:33,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:33,498 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:33,498 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=15} Honda state: {~a8~0=15} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:33,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:33,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,506 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 15:48:33,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:33,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:33,518 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:33,518 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input#1=0} Honda state: {ULTIMATE.start_calculate_output_#in~input#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:33,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 15:48:33,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,525 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 15:48:33,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:33,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:33,539 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:33,539 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret7#1=0} Honda state: {ULTIMATE.start_main_#t~ret7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:33,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 15:48:33,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,548 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 15:48:33,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:33,551 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:33,563 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:33,563 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:33,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:33,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,571 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 15:48:33,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:33,573 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:33,590 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-04 15:48:33,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,594 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 15:48:33,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:48:33,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:33,607 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:48:33,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-04 15:48:33,613 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:33,613 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:33,613 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:33,613 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:33,613 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:48:33,613 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,613 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:33,613 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:33,613 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label56.c_Iteration3_Loop [2025-03-04 15:48:33,613 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:33,613 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:33,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:33,758 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:33,758 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:48:33,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,764 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 15:48:33,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:33,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:33,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:33,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:33,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:33,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:33,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:33,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:33,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:33,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:33,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,795 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 15:48:33,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:33,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:33,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:33,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:33,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:33,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:33,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:33,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:33,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:33,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 15:48:33,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,816 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 15:48:33,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:33,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:33,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:33,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:33,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:33,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:33,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:33,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:33,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:33,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:33,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,838 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 15:48:33,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:33,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:33,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:33,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:33,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:33,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:33,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:33,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:33,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:33,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-04 15:48:33,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,858 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 15:48:33,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:33,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:33,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:33,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:33,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:33,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:33,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:33,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:33,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:33,876 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-04 15:48:33,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,879 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 15:48:33,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:33,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:33,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:33,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:33,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:33,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:33,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:33,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:33,893 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:48:33,894 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:48:33,894 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:48:33,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:33,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:33,896 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:33,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 15:48:33,898 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:48:33,898 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:48:33,898 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:48:33,898 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a17~0) = 1*~a17~0 Supporting invariants [] [2025-03-04 15:48:33,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 15:48:33,904 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:48:33,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:33,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:48:33,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:48:33,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:33,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:33,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:48:33,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:33,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:48:33,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:48:33,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:33,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:33,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:48:33,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:48:33,966 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:48:33,966 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1253 states and 1714 transitions. cyclomatic complexity: 470 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:34,355 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1253 states and 1714 transitions. cyclomatic complexity: 470. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 4230 states and 5475 transitions. Complement of second has 6 states. [2025-03-04 15:48:34,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:48:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 608 transitions. [2025-03-04 15:48:34,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 608 transitions. Stem has 4 letters. Loop has 9 letters. [2025-03-04 15:48:34,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:34,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 608 transitions. Stem has 13 letters. Loop has 9 letters. [2025-03-04 15:48:34,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:34,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 608 transitions. Stem has 4 letters. Loop has 18 letters. [2025-03-04 15:48:34,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:34,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4230 states and 5475 transitions. [2025-03-04 15:48:34,383 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1110 [2025-03-04 15:48:34,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4230 states to 3915 states and 4972 transitions. [2025-03-04 15:48:34,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1121 [2025-03-04 15:48:34,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1126 [2025-03-04 15:48:34,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3915 states and 4972 transitions. [2025-03-04 15:48:34,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:34,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3915 states and 4972 transitions. [2025-03-04 15:48:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states and 4972 transitions. [2025-03-04 15:48:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3908. [2025-03-04 15:48:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3908 states have (on average 1.2704708290685773) internal successors, (4965), 3907 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 4965 transitions. [2025-03-04 15:48:34,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3908 states and 4965 transitions. [2025-03-04 15:48:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:48:34,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:48:34,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:48:34,494 INFO L87 Difference]: Start difference. First operand 3908 states and 4965 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:34,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-04 15:48:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:48:35,032 INFO L93 Difference]: Finished difference Result 7329 states and 8838 transitions. [2025-03-04 15:48:35,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7329 states and 8838 transitions. [2025-03-04 15:48:35,067 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2096 [2025-03-04 15:48:35,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7329 states to 7268 states and 8746 transitions. [2025-03-04 15:48:35,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2107 [2025-03-04 15:48:35,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2107 [2025-03-04 15:48:35,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7268 states and 8746 transitions. [2025-03-04 15:48:35,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:35,109 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7268 states and 8746 transitions. [2025-03-04 15:48:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states and 8746 transitions. [2025-03-04 15:48:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 7268. [2025-03-04 15:48:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7268 states, 7268 states have (on average 1.2033571821684095) internal successors, (8746), 7267 states have internal predecessors, (8746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 8746 transitions. [2025-03-04 15:48:35,219 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7268 states and 8746 transitions. [2025-03-04 15:48:35,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:48:35,221 INFO L432 stractBuchiCegarLoop]: Abstraction has 7268 states and 8746 transitions. [2025-03-04 15:48:35,221 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:48:35,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7268 states and 8746 transitions. [2025-03-04 15:48:35,253 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2096 [2025-03-04 15:48:35,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:35,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:35,256 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:48:35,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:48:35,257 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-04 15:48:35,258 INFO L754 eck$LassoCheckResult]: Loop: "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume !((1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0);" "assume !((8 == ~a12~0 && (1 == ~a21~0 && ((5 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(8 == ~a12~0 && 1 == calculate_output_~input#1 && ((1 == ~a21~0 && (15 == ~a8~0 && (!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && 13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0)));" "assume !((((!(1 == ~a17~0) && !(1 == ~a7~0) && 1 == ~a21~0 && 15 == ~a8~0 && 4 == calculate_output_~input#1) && !(1 == ~a20~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 2 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && ((3 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0))) && 8 == ~a12~0) && 1 == ~a7~0);" "assume !(((1 == ~a21~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1 && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || (5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0))) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !((5 == ~a16~0 && (1 == ~a7~0 && (!(1 == ~a21~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (15 == ~a8~0 && (8 == ~a12~0 && (!(1 == ~a7~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a20~0)) && 5 == ~a16~0);" "assume !(!(1 == ~a7~0) && (((1 == ~a21~0 && (15 == ~a8~0 && 5 == calculate_output_~input#1) && !(1 == ~a17~0)) && 8 == ~a12~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !((!(1 == ~a21~0) && (8 == ~a12~0 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0)) && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a7~0);" "assume !(1 == ~a17~0 && !(1 == ~a7~0) && (1 == ~a21~0 && (8 == ~a12~0 && 5 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && !(1 == ~a21~0) && 1 == ~a7~0 && 13 == ~a8~0 && 6 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (4 == ~a16~0 && !(1 == ~a17~0))) || (5 == ~a16~0 && !(1 == ~a17~0)))) && 1 == ~a20~0);" "assume !((5 == ~a16~0 && ((15 == ~a8~0 && (!(1 == ~a7~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a12~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(!(1 == ~a20~0) && 1 == ~a21~0 && 4 == ~a16~0 && 15 == ~a8~0 && (8 == ~a12~0 && 2 == calculate_output_~input#1 && !(1 == ~a7~0)) && !(1 == ~a17~0));" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && (!(1 == ~a20~0) && !(1 == ~a17~0) && 8 == ~a12~0 && 6 == calculate_output_~input#1) && 4 == ~a16~0) && 15 == ~a8~0);" "assume !(1 == ~a17~0 && ((((8 == ~a12~0 && 4 == calculate_output_~input#1 && 13 == ~a8~0) && 1 == ~a20~0) && !(1 == ~a21~0)) && 5 == ~a16~0) && 1 == ~a7~0);" "assume !(((13 == ~a8~0 && 8 == ~a12~0 && ((((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0)) && 1 == calculate_output_~input#1) && !(1 == ~a21~0)) && 1 == ~a20~0) && 1 == ~a7~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && (((((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 5 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0);" "assume !((!(1 == ~a21~0) && ((((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)) && 4 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0) && 13 == ~a8~0);" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && ((((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && ((1 == ~a7~0 && 1 == ~a17~0) && 1 == ~a20~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(!(1 == ~a17~0) && (8 == ~a12~0 && !(1 == ~a20~0) && (15 == ~a8~0 && 1 == ~a21~0 && 4 == calculate_output_~input#1) && !(1 == ~a7~0)) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && (2 == calculate_output_~input#1 && (((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 15 == ~a8~0) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(!(1 == ~a20~0) && (((((6 == calculate_output_~input#1 && 5 == ~a16~0) && 1 == ~a21~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !(8 == ~a12~0 && (((((1 == ~a21~0 && 5 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0);" "assume !(((15 == ~a8~0 && !(1 == ~a7~0) && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 5 == ~a16~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(15 == ~a8~0 && 4 == ~a16~0 && !(1 == ~a20~0) && ((1 == ~a21~0 && !(1 == ~a17~0) && 5 == calculate_output_~input#1) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && 8 == ~a12~0 && 15 == ~a8~0 && ((!(1 == ~a7~0) && (5 == ~a16~0 || 6 == ~a16~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(!(1 == ~a7~0) && (15 == ~a8~0 && (!(1 == ~a17~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(5 == ~a16~0 && (!(1 == ~a21~0) && (13 == ~a8~0 && (2 == calculate_output_~input#1 && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && 1 == ~a17~0);" "assume !(1 == ~a20~0 && (8 == ~a12~0 && 1 == ~a7~0 && 13 == ~a8~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 3 == calculate_output_~input#1) && !(1 == ~a21~0));" "assume !(8 == ~a12~0 && 1 == ~a7~0 && !(1 == ~a21~0) && 13 == ~a8~0 && 6 == calculate_output_~input#1 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))));" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && ((4 == ~a16~0 && 15 == ~a8~0 && 1 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a20~0) && 8 == ~a12~0 && 15 == ~a8~0 && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && 6 == ~a16~0);" "assume !(1 == ~a20~0 && 8 == ~a12~0 && ((1 == ~a17~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 4 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((13 == ~a8~0 && (((!(1 == ~a21~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a17~0) && 1 == ~a7~0) && 5 == ~a16~0);" "assume !(5 == ~a16~0 && (((8 == ~a12~0 && !(1 == ~a7~0) && 2 == calculate_output_~input#1 && !(1 == ~a20~0)) && 1 == ~a21~0) && 1 == ~a17~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && ((!(1 == ~a17~0) && 1 == ~a21~0 && 4 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !(1 == ~a7~0 && 13 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a21~0) && 2 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)));" "assume !(((((((!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (((13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 4 == ~a16~0) && !(1 == ~a21~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && (((3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 15 == ~a8~0) && 8 == ~a12~0) && !(1 == ~a20~0));" "assume !((((8 == ~a12~0 && (((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0) || ((1 == ~a20~0 && !(1 == ~a17~0)) && 5 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) && 3 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((!(1 == ~a7~0) && (5 == calculate_output_~input#1 && (((5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !((!(1 == ~a7~0) && (1 == ~a21~0 && (1 == ~a17~0 && 8 == ~a12~0 && 2 == calculate_output_~input#1) && !(1 == ~a20~0)) && 6 == ~a16~0) && 15 == ~a8~0);" "assume !((!(1 == ~a17~0) && 1 == ~a21~0 && (!(1 == ~a20~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0);" "assume !((5 == ~a16~0 && !(1 == ~a20~0) && (((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(!(1 == ~a7~0) && 1 == ~a17~0 && (6 == ~a16~0 && !(1 == ~a20~0) && (6 == calculate_output_~input#1 && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a7~0) && !(1 == ~a17~0) && 2 == calculate_output_~input#1) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(15 == ~a8~0 && (4 == ~a16~0 && 8 == ~a12~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && !(1 == ~a17~0)) && 1 == ~a21~0);" "assume !(1 == ~a21~0 && (8 == ~a12~0 && ((1 == ~a17~0 && 3 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && !(1 == ~a7~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !(!(1 == ~a21~0) && 1 == ~a20~0 && (8 == ~a12~0 && 13 == ~a8~0 && ((5 == ~a16~0 && !(1 == ~a17~0)) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 2 == calculate_output_~input#1) && 1 == ~a7~0);" "assume !(1 == ~a7~0 && 8 == ~a12~0 && ((1 == ~a20~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (4 == ~a16~0 && !(1 == ~a17~0))) && 4 == calculate_output_~input#1) && 13 == ~a8~0) && !(1 == ~a21~0));" "assume !(1 == ~a21~0 && (((!(1 == ~a7~0) && 15 == ~a8~0 && !(1 == ~a20~0) && 4 == calculate_output_~input#1) && 1 == ~a17~0) && 5 == ~a16~0) && 8 == ~a12~0);" "assume !(((!(1 == ~a7~0) && (!(1 == ~a20~0) && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 1 == ~a17~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !((((!(1 == ~a17~0) && !(1 == ~a20~0) && 15 == ~a8~0 && 1 == calculate_output_~input#1 && 5 == ~a16~0) && 8 == ~a12~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && (5 == ~a16~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0));" "assume !((!(1 == ~a21~0) && 1 == ~a20~0 && ((13 == ~a8~0 && 1 == ~a7~0 && 5 == calculate_output_~input#1) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && 1 == ~a21~0 && ((6 == calculate_output_~input#1 && 1 == ~a20~0) && 15 == ~a8~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume ((1 == ~a20~0 && ((!(1 == ~a21~0) && 1 == ~a7~0 && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0;~a21~0 := 1;~a16~0 := 6;~a7~0 := 0;calculate_output_#res#1 := -1;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-04 15:48:35,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash 404592514, now seen corresponding path program 1 times [2025-03-04 15:48:35,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:35,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926178375] [2025-03-04 15:48:35,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:35,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:35,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:48:35,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:48:35,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:35,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:35,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:35,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:48:35,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:48:35,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:35,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:35,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:35,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash 844816958, now seen corresponding path program 1 times [2025-03-04 15:48:35,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:35,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264173228] [2025-03-04 15:48:35,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:35,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 15:48:35,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:48:35,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:35,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:35,318 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:35,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 15:48:35,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:48:35,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:35,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:35,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:35,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1102465343, now seen corresponding path program 1 times [2025-03-04 15:48:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:35,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917219926] [2025-03-04 15:48:35,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:35,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 15:48:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 15:48:35,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:48:35,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:48:35,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917219926] [2025-03-04 15:48:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917219926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:48:35,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:48:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:48:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861656269] [2025-03-04 15:48:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:48:35,814 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:35,814 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:35,814 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:35,814 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:35,814 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:48:35,814 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:35,814 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:35,814 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:35,814 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label56.c_Iteration4_Loop [2025-03-04 15:48:35,814 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:35,814 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:35,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:35,964 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:35,964 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:48:35,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:35,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:35,967 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:35,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 15:48:35,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:35,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:35,980 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:35,980 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:35,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 15:48:35,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:35,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:35,987 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:36,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 15:48:36,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:36,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:36,026 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:36,026 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_~input#1=1} Honda state: {ULTIMATE.start_calculate_output_~input#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:36,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:36,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:36,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:36,034 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:36,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 15:48:36,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:36,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:36,046 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:48:36,046 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=13} Honda state: {~a8~0=13} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:48:36,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:36,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:36,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:36,054 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:36,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 15:48:36,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:48:36,055 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:36,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 15:48:36,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:36,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:36,073 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:36,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 15:48:36,074 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:48:36,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:48:36,086 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:48:36,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 15:48:36,092 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:48:36,092 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:48:36,092 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:48:36,092 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:48:36,092 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:48:36,092 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:36,092 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:48:36,092 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:48:36,092 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label56.c_Iteration4_Loop [2025-03-04 15:48:36,092 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:48:36,092 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:48:36,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:48:36,221 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:48:36,221 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:48:36,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:36,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:36,224 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:36,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 15:48:36,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:36,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:36,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:36,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:36,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:36,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:36,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:36,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:36,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:36,246 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-04 15:48:36,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:36,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:36,248 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:36,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 15:48:36,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:36,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:36,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:36,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:36,261 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-03-04 15:48:36,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:36,263 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-04 15:48:36,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:36,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:36,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 15:48:36,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:36,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:36,275 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:36,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 15:48:36,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:36,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:36,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:36,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:36,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:36,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:36,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:36,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:36,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:36,295 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-04 15:48:36,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:36,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:36,297 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:36,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 15:48:36,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:36,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:36,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:36,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:36,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:36,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:36,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:36,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:36,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:48:36,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 15:48:36,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:36,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:36,323 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:36,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 15:48:36,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:48:36,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:48:36,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:48:36,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:48:36,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:48:36,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:48:36,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:48:36,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:48:36,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:48:36,341 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:48:36,341 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:48:36,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:48:36,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:48:36,343 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:48:36,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-04 15:48:36,344 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:48:36,344 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:48:36,344 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:48:36,344 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a7~0) = 1*~a7~0 Supporting invariants [] [2025-03-04 15:48:36,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-03-04 15:48:36,350 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:48:36,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:36,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:48:36,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:48:36,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:36,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:36,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:48:36,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:36,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 15:48:36,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 15:48:36,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:36,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:36,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:48:36,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:48:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:48:36,488 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:48:36,488 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7268 states and 8746 transitions. cyclomatic complexity: 1515 Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:36,828 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7268 states and 8746 transitions. cyclomatic complexity: 1515. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24257 states and 28318 transitions. Complement of second has 5 states. [2025-03-04 15:48:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:48:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-03-04 15:48:36,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 5 letters. Loop has 68 letters. [2025-03-04 15:48:36,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:36,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 73 letters. Loop has 68 letters. [2025-03-04 15:48:36,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:36,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 5 letters. Loop has 136 letters. [2025-03-04 15:48:36,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:48:36,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24257 states and 28318 transitions. [2025-03-04 15:48:36,910 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 4192 [2025-03-04 15:48:36,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24257 states to 24257 states and 28318 transitions. [2025-03-04 15:48:36,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4231 [2025-03-04 15:48:37,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4243 [2025-03-04 15:48:37,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24257 states and 28318 transitions. [2025-03-04 15:48:37,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:37,004 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24257 states and 28318 transitions. [2025-03-04 15:48:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24257 states and 28318 transitions. [2025-03-04 15:48:37,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 15:48:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24257 to 24234. [2025-03-04 15:48:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24234 states, 24234 states have (on average 1.1675744821325411) internal successors, (28295), 24233 states have internal predecessors, (28295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24234 states to 24234 states and 28295 transitions. [2025-03-04 15:48:37,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24234 states and 28295 transitions. [2025-03-04 15:48:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:48:37,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:48:37,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:48:37,377 INFO L87 Difference]: Start difference. First operand 24234 states and 28295 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:48:37,812 INFO L93 Difference]: Finished difference Result 48032 states and 54853 transitions. [2025-03-04 15:48:37,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48032 states and 54853 transitions. [2025-03-04 15:48:38,090 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 8384 [2025-03-04 15:48:38,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48032 states to 45131 states and 51547 transitions. [2025-03-04 15:48:38,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8441 [2025-03-04 15:48:38,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8441 [2025-03-04 15:48:38,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45131 states and 51547 transitions. [2025-03-04 15:48:38,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:38,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45131 states and 51547 transitions. [2025-03-04 15:48:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45131 states and 51547 transitions. [2025-03-04 15:48:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45131 to 41166. [2025-03-04 15:48:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41166 states, 41166 states have (on average 1.1480590778798037) internal successors, (47261), 41165 states have internal predecessors, (47261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41166 states to 41166 states and 47261 transitions. [2025-03-04 15:48:38,775 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41166 states and 47261 transitions. [2025-03-04 15:48:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:48:38,776 INFO L432 stractBuchiCegarLoop]: Abstraction has 41166 states and 47261 transitions. [2025-03-04 15:48:38,776 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:48:38,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41166 states and 47261 transitions. [2025-03-04 15:48:38,939 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-04 15:48:38,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:38,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:38,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:48:38,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:48:38,941 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-04 15:48:38,941 INFO L754 eck$LassoCheckResult]: Loop: "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume !((1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0);" "assume !((8 == ~a12~0 && (1 == ~a21~0 && ((5 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(8 == ~a12~0 && 1 == calculate_output_~input#1 && ((1 == ~a21~0 && (15 == ~a8~0 && (!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && 13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0)));" "assume !((((!(1 == ~a17~0) && !(1 == ~a7~0) && 1 == ~a21~0 && 15 == ~a8~0 && 4 == calculate_output_~input#1) && !(1 == ~a20~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 2 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && ((3 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0))) && 8 == ~a12~0) && 1 == ~a7~0);" "assume !(((1 == ~a21~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1 && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || (5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0))) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !((5 == ~a16~0 && (1 == ~a7~0 && (!(1 == ~a21~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (15 == ~a8~0 && (8 == ~a12~0 && (!(1 == ~a7~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a20~0)) && 5 == ~a16~0);" "assume !(!(1 == ~a7~0) && (((1 == ~a21~0 && (15 == ~a8~0 && 5 == calculate_output_~input#1) && !(1 == ~a17~0)) && 8 == ~a12~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !((!(1 == ~a21~0) && (8 == ~a12~0 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0)) && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a7~0);" "assume !(1 == ~a17~0 && !(1 == ~a7~0) && (1 == ~a21~0 && (8 == ~a12~0 && 5 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && !(1 == ~a21~0) && 1 == ~a7~0 && 13 == ~a8~0 && 6 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (4 == ~a16~0 && !(1 == ~a17~0))) || (5 == ~a16~0 && !(1 == ~a17~0)))) && 1 == ~a20~0);" "assume !((5 == ~a16~0 && ((15 == ~a8~0 && (!(1 == ~a7~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a12~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(!(1 == ~a20~0) && 1 == ~a21~0 && 4 == ~a16~0 && 15 == ~a8~0 && (8 == ~a12~0 && 2 == calculate_output_~input#1 && !(1 == ~a7~0)) && !(1 == ~a17~0));" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && (!(1 == ~a20~0) && !(1 == ~a17~0) && 8 == ~a12~0 && 6 == calculate_output_~input#1) && 4 == ~a16~0) && 15 == ~a8~0);" "assume !(1 == ~a17~0 && ((((8 == ~a12~0 && 4 == calculate_output_~input#1 && 13 == ~a8~0) && 1 == ~a20~0) && !(1 == ~a21~0)) && 5 == ~a16~0) && 1 == ~a7~0);" "assume !(((13 == ~a8~0 && 8 == ~a12~0 && ((((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0)) && 1 == calculate_output_~input#1) && !(1 == ~a21~0)) && 1 == ~a20~0) && 1 == ~a7~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && (((((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 5 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0);" "assume !((!(1 == ~a21~0) && ((((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)) && 4 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0) && 13 == ~a8~0);" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && ((((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && ((1 == ~a7~0 && 1 == ~a17~0) && 1 == ~a20~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(!(1 == ~a17~0) && (8 == ~a12~0 && !(1 == ~a20~0) && (15 == ~a8~0 && 1 == ~a21~0 && 4 == calculate_output_~input#1) && !(1 == ~a7~0)) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && (2 == calculate_output_~input#1 && (((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 15 == ~a8~0) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(!(1 == ~a20~0) && (((((6 == calculate_output_~input#1 && 5 == ~a16~0) && 1 == ~a21~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !(8 == ~a12~0 && (((((1 == ~a21~0 && 5 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0);" "assume !(((15 == ~a8~0 && !(1 == ~a7~0) && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 5 == ~a16~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(15 == ~a8~0 && 4 == ~a16~0 && !(1 == ~a20~0) && ((1 == ~a21~0 && !(1 == ~a17~0) && 5 == calculate_output_~input#1) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && 8 == ~a12~0 && 15 == ~a8~0 && ((!(1 == ~a7~0) && (5 == ~a16~0 || 6 == ~a16~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(!(1 == ~a7~0) && (15 == ~a8~0 && (!(1 == ~a17~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(5 == ~a16~0 && (!(1 == ~a21~0) && (13 == ~a8~0 && (2 == calculate_output_~input#1 && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && 1 == ~a17~0);" "assume !(1 == ~a20~0 && (8 == ~a12~0 && 1 == ~a7~0 && 13 == ~a8~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 3 == calculate_output_~input#1) && !(1 == ~a21~0));" "assume !(8 == ~a12~0 && 1 == ~a7~0 && !(1 == ~a21~0) && 13 == ~a8~0 && 6 == calculate_output_~input#1 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))));" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && ((4 == ~a16~0 && 15 == ~a8~0 && 1 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a20~0) && 8 == ~a12~0 && 15 == ~a8~0 && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && 6 == ~a16~0);" "assume !(1 == ~a20~0 && 8 == ~a12~0 && ((1 == ~a17~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 4 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((13 == ~a8~0 && (((!(1 == ~a21~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a17~0) && 1 == ~a7~0) && 5 == ~a16~0);" "assume !(5 == ~a16~0 && (((8 == ~a12~0 && !(1 == ~a7~0) && 2 == calculate_output_~input#1 && !(1 == ~a20~0)) && 1 == ~a21~0) && 1 == ~a17~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && ((!(1 == ~a17~0) && 1 == ~a21~0 && 4 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !(1 == ~a7~0 && 13 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a21~0) && 2 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)));" "assume !(((((((!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (((13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 4 == ~a16~0) && !(1 == ~a21~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && (((3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 15 == ~a8~0) && 8 == ~a12~0) && !(1 == ~a20~0));" "assume !((((8 == ~a12~0 && (((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0) || ((1 == ~a20~0 && !(1 == ~a17~0)) && 5 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) && 3 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((!(1 == ~a7~0) && (5 == calculate_output_~input#1 && (((5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !((!(1 == ~a7~0) && (1 == ~a21~0 && (1 == ~a17~0 && 8 == ~a12~0 && 2 == calculate_output_~input#1) && !(1 == ~a20~0)) && 6 == ~a16~0) && 15 == ~a8~0);" "assume !((!(1 == ~a17~0) && 1 == ~a21~0 && (!(1 == ~a20~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0);" "assume !((5 == ~a16~0 && !(1 == ~a20~0) && (((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(!(1 == ~a7~0) && 1 == ~a17~0 && (6 == ~a16~0 && !(1 == ~a20~0) && (6 == calculate_output_~input#1 && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a7~0) && !(1 == ~a17~0) && 2 == calculate_output_~input#1) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(15 == ~a8~0 && (4 == ~a16~0 && 8 == ~a12~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && !(1 == ~a17~0)) && 1 == ~a21~0);" "assume !(1 == ~a21~0 && (8 == ~a12~0 && ((1 == ~a17~0 && 3 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && !(1 == ~a7~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !(!(1 == ~a21~0) && 1 == ~a20~0 && (8 == ~a12~0 && 13 == ~a8~0 && ((5 == ~a16~0 && !(1 == ~a17~0)) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 2 == calculate_output_~input#1) && 1 == ~a7~0);" "assume !(1 == ~a7~0 && 8 == ~a12~0 && ((1 == ~a20~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (4 == ~a16~0 && !(1 == ~a17~0))) && 4 == calculate_output_~input#1) && 13 == ~a8~0) && !(1 == ~a21~0));" "assume !(1 == ~a21~0 && (((!(1 == ~a7~0) && 15 == ~a8~0 && !(1 == ~a20~0) && 4 == calculate_output_~input#1) && 1 == ~a17~0) && 5 == ~a16~0) && 8 == ~a12~0);" "assume !(((!(1 == ~a7~0) && (!(1 == ~a20~0) && 1 == ~a21~0 && 3 == calculate_output_~input#1 && 1 == ~a17~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !((((!(1 == ~a17~0) && !(1 == ~a20~0) && 15 == ~a8~0 && 1 == calculate_output_~input#1 && 5 == ~a16~0) && 8 == ~a12~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((1 == ~a21~0 && 15 == ~a8~0 && (5 == ~a16~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0));" "assume !((!(1 == ~a21~0) && 1 == ~a20~0 && ((13 == ~a8~0 && 1 == ~a7~0 && 5 == calculate_output_~input#1) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && 1 == ~a21~0 && ((6 == calculate_output_~input#1 && 1 == ~a20~0) && 15 == ~a8~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((1 == ~a20~0 && ((!(1 == ~a21~0) && 1 == ~a7~0 && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 8 == ~a12~0) && 5 == ~a16~0);" "assume !(8 == ~a12~0 && 5 == calculate_output_~input#1 && ((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a7~0 && 1 == ~a17~0) && 13 == ~a8~0)));" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && 1 == ~a7~0) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && !(1 == ~a20~0)) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((1 == ~a17~0 && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 13 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 6 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && 1 == ~a7~0) && 1 == ~a20~0) && 14 == ~a8~0) && 8 == ~a12~0) && 4 == ~a16~0) && 1 == ~a21~0);" "assume !((((((!(1 == ~a17~0) && !(1 == ~a7~0)) && 1 == ~a20~0) && 13 == ~a8~0) && 8 == ~a12~0) && 5 == ~a16~0) && 1 == ~a21~0);" "calculate_output_#res#1 := -2;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" [2025-03-04 15:48:38,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:38,942 INFO L85 PathProgramCache]: Analyzing trace with hash 404592514, now seen corresponding path program 2 times [2025-03-04 15:48:38,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:38,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230838521] [2025-03-04 15:48:38,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:48:38,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:38,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:48:38,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:48:38,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:48:38,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:38,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:38,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:48:38,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:48:38,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:38,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:38,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:38,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1946022558, now seen corresponding path program 1 times [2025-03-04 15:48:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:38,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520433326] [2025-03-04 15:48:38,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:38,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:38,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 15:48:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 15:48:38,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:38,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:38,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:38,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 15:48:38,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 15:48:38,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:38,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:38,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:38,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2076784063, now seen corresponding path program 1 times [2025-03-04 15:48:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:38,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441281616] [2025-03-04 15:48:38,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:38,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:39,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 15:48:39,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 15:48:39,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:39,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:48:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:48:39,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:48:39,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441281616] [2025-03-04 15:48:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441281616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:48:39,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:48:39,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:48:39,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076346583] [2025-03-04 15:48:39,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:48:44,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:48:44,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:48:44,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:48:44,536 INFO L87 Difference]: Start difference. First operand 41166 states and 47261 transitions. cyclomatic complexity: 6257 Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 9 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:48:45,287 INFO L93 Difference]: Finished difference Result 42262 states and 48369 transitions. [2025-03-04 15:48:45,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42262 states and 48369 transitions. [2025-03-04 15:48:45,387 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-04 15:48:45,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42262 states to 41570 states and 47677 transitions. [2025-03-04 15:48:45,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7384 [2025-03-04 15:48:45,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7384 [2025-03-04 15:48:45,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41570 states and 47677 transitions. [2025-03-04 15:48:45,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:48:45,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41570 states and 47677 transitions. [2025-03-04 15:48:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41570 states and 47677 transitions. [2025-03-04 15:48:45,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41570 to 41570. [2025-03-04 15:48:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41570 states, 41570 states have (on average 1.1469088284820783) internal successors, (47677), 41569 states have internal predecessors, (47677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:48:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41570 states to 41570 states and 47677 transitions. [2025-03-04 15:48:45,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41570 states and 47677 transitions. [2025-03-04 15:48:45,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:48:45,791 INFO L432 stractBuchiCegarLoop]: Abstraction has 41570 states and 47677 transitions. [2025-03-04 15:48:45,791 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:48:45,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41570 states and 47677 transitions. [2025-03-04 15:48:45,853 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-04 15:48:45,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:48:45,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:48:45,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:48:45,854 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:48:45,854 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~a~0 := 1;~d~0 := 4;~e~0 := 5;~f~0 := 6;~c~0 := 3;~b~0 := 2;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a17~0 := 1;~a7~0 := 0;~a20~0 := 1;~a8~0 := 15;~a12~0 := 8;~a16~0 := 5;~a21~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1;" "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume (15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0;~a16~0 := 5;~a20~0 := 0;calculate_output_#res#1 := 24;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" [2025-03-04 15:48:45,855 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_~input~0#1;havoc main_#t~nondet6#1;main_~input~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1;" "assume !((15 == ~a8~0 && (((1 == ~a21~0 && (5 == ~a16~0 || 6 == ~a16~0) && 1 == calculate_output_~input#1) && 1 == ~a20~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !((((((5 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0))) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && !(1 == ~a21~0)) && 13 == ~a8~0);" "assume !((!(1 == ~a7~0) && ((6 == ~a16~0 && 1 == ~a21~0 && 1 == ~a17~0 && 3 == calculate_output_~input#1) && !(1 == ~a20~0)) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && (!(1 == ~a7~0) && (1 == ~a21~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 15 == ~a8~0) && 8 == ~a12~0);" "assume !((3 == calculate_output_~input#1 && (((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a7~0) && !(1 == ~a17~0)) && 15 == ~a8~0) && 1 == ~a21~0) || (((13 == ~a8~0 && 1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 4 == ~a16~0) && !(1 == ~a21~0)))) && 8 == ~a12~0);" "assume !((1 == ~a17~0 && (1 == ~a21~0 && (!(1 == ~a7~0) && 4 == calculate_output_~input#1 && 15 == ~a8~0) && !(1 == ~a20~0)) && 8 == ~a12~0) && 6 == ~a16~0);" "assume !((8 == ~a12~0 && (1 == ~a21~0 && ((5 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(8 == ~a12~0 && 1 == calculate_output_~input#1 && ((1 == ~a21~0 && (15 == ~a8~0 && (!(1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0) || (!(1 == ~a21~0) && 4 == ~a16~0 && 13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0)));" "assume !((((!(1 == ~a17~0) && !(1 == ~a7~0) && 1 == ~a21~0 && 15 == ~a8~0 && 4 == calculate_output_~input#1) && !(1 == ~a20~0)) && 8 == ~a12~0) && 4 == ~a16~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && (1 == ~a20~0 && 1 == ~a17~0 && 1 == ~a7~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 2 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && ((3 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0))) && 8 == ~a12~0) && 1 == ~a7~0);" "assume !(((1 == ~a21~0 && 8 == ~a12~0 && 1 == calculate_output_~input#1 && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || (5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0))) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !((5 == ~a16~0 && (1 == ~a7~0 && (!(1 == ~a21~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a17~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (15 == ~a8~0 && (8 == ~a12~0 && (!(1 == ~a7~0) && 5 == calculate_output_~input#1) && 1 == ~a21~0) && !(1 == ~a20~0)) && 5 == ~a16~0);" "assume !(!(1 == ~a7~0) && (((1 == ~a21~0 && (15 == ~a8~0 && 5 == calculate_output_~input#1) && !(1 == ~a17~0)) && 8 == ~a12~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !((!(1 == ~a21~0) && (8 == ~a12~0 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0)) && 1 == calculate_output_~input#1) && 13 == ~a8~0) && 1 == ~a7~0);" "assume !(1 == ~a17~0 && !(1 == ~a7~0) && (1 == ~a21~0 && (8 == ~a12~0 && 5 == calculate_output_~input#1 && (5 == ~a16~0 || 6 == ~a16~0)) && 1 == ~a20~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && !(1 == ~a21~0) && 1 == ~a7~0 && 13 == ~a8~0 && 6 == calculate_output_~input#1 && (((6 == ~a16~0 && 1 == ~a17~0) || (4 == ~a16~0 && !(1 == ~a17~0))) || (5 == ~a16~0 && !(1 == ~a17~0)))) && 1 == ~a20~0);" "assume !((5 == ~a16~0 && ((15 == ~a8~0 && (!(1 == ~a7~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 8 == ~a12~0) && !(1 == ~a20~0)) && !(1 == ~a17~0));" "assume !(!(1 == ~a20~0) && 1 == ~a21~0 && 4 == ~a16~0 && 15 == ~a8~0 && (8 == ~a12~0 && 2 == calculate_output_~input#1 && !(1 == ~a7~0)) && !(1 == ~a17~0));" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && (!(1 == ~a20~0) && !(1 == ~a17~0) && 8 == ~a12~0 && 6 == calculate_output_~input#1) && 4 == ~a16~0) && 15 == ~a8~0);" "assume !(1 == ~a17~0 && ((((8 == ~a12~0 && 4 == calculate_output_~input#1 && 13 == ~a8~0) && 1 == ~a20~0) && !(1 == ~a21~0)) && 5 == ~a16~0) && 1 == ~a7~0);" "assume !(((13 == ~a8~0 && 8 == ~a12~0 && ((((6 == ~a16~0 && 1 == ~a17~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) || (!(1 == ~a17~0) && 5 == ~a16~0)) && 1 == calculate_output_~input#1) && !(1 == ~a21~0)) && 1 == ~a20~0) && 1 == ~a7~0);" "assume !(13 == ~a8~0 && !(1 == ~a21~0) && (((((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 5 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0);" "assume !((!(1 == ~a21~0) && ((((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)) && 4 == calculate_output_~input#1) && 1 == ~a7~0) && 8 == ~a12~0) && 13 == ~a8~0);" "assume !((1 == ~a21~0 && !(1 == ~a7~0) && ((((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0) && 15 == ~a8~0);" "assume !(((((6 == ~a16~0 && (!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a21~0) || ((4 == ~a16~0 && ((1 == ~a7~0 && 1 == ~a17~0) && 1 == ~a20~0) && 13 == ~a8~0) && !(1 == ~a21~0))) && 4 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !(!(1 == ~a17~0) && (8 == ~a12~0 && !(1 == ~a20~0) && (15 == ~a8~0 && 1 == ~a21~0 && 4 == calculate_output_~input#1) && !(1 == ~a7~0)) && 5 == ~a16~0);" "assume !(((!(1 == ~a7~0) && (2 == calculate_output_~input#1 && (((5 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 15 == ~a8~0) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(!(1 == ~a20~0) && (((((6 == calculate_output_~input#1 && 5 == ~a16~0) && 1 == ~a21~0) && !(1 == ~a17~0)) && 8 == ~a12~0) && !(1 == ~a7~0)) && 15 == ~a8~0);" "assume !(8 == ~a12~0 && (((((1 == ~a21~0 && 5 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && !(1 == ~a20~0)) && 6 == ~a16~0);" "assume !(((15 == ~a8~0 && !(1 == ~a7~0) && (((!(1 == ~a20~0) && 1 == ~a17~0) && 4 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 5 == ~a16~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0);" "assume !(15 == ~a8~0 && 4 == ~a16~0 && !(1 == ~a20~0) && ((1 == ~a21~0 && !(1 == ~a17~0) && 5 == calculate_output_~input#1) && !(1 == ~a7~0)) && 8 == ~a12~0);" "assume !(1 == ~a17~0 && 8 == ~a12~0 && 15 == ~a8~0 && ((!(1 == ~a7~0) && (5 == ~a16~0 || 6 == ~a16~0) && 2 == calculate_output_~input#1) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(!(1 == ~a7~0) && (15 == ~a8~0 && (!(1 == ~a17~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 1 == ~a20~0);" "assume !(5 == ~a16~0 && (!(1 == ~a21~0) && (13 == ~a8~0 && (2 == calculate_output_~input#1 && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a7~0) && 1 == ~a17~0);" "assume !(1 == ~a20~0 && (8 == ~a12~0 && 1 == ~a7~0 && 13 == ~a8~0 && ((!(1 == ~a17~0) && 5 == ~a16~0) || (1 == ~a17~0 && 6 == ~a16~0) || (!(1 == ~a17~0) && 4 == ~a16~0)) && 3 == calculate_output_~input#1) && !(1 == ~a21~0));" "assume !(8 == ~a12~0 && 1 == ~a7~0 && !(1 == ~a21~0) && 13 == ~a8~0 && 6 == calculate_output_~input#1 && ((6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0)) || (4 == ~a16~0 && 1 == ~a17~0 && !(1 == ~a20~0))));" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && ((4 == ~a16~0 && 15 == ~a8~0 && 1 == calculate_output_~input#1) && 8 == ~a12~0) && 1 == ~a21~0) && 1 == ~a20~0);" "assume !(1 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a20~0) && 8 == ~a12~0 && 15 == ~a8~0 && !(1 == ~a7~0) && 1 == calculate_output_~input#1) && 6 == ~a16~0);" "assume !(1 == ~a20~0 && 8 == ~a12~0 && ((1 == ~a17~0 && ((5 == ~a16~0 || 6 == ~a16~0) && 4 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((13 == ~a8~0 && (((!(1 == ~a21~0) && 6 == calculate_output_~input#1) && 1 == ~a20~0) && 8 == ~a12~0) && 1 == ~a17~0) && 1 == ~a7~0) && 5 == ~a16~0);" "assume !(5 == ~a16~0 && (((8 == ~a12~0 && !(1 == ~a7~0) && 2 == calculate_output_~input#1 && !(1 == ~a20~0)) && 1 == ~a21~0) && 1 == ~a17~0) && 15 == ~a8~0);" "assume !((8 == ~a12~0 && ((!(1 == ~a17~0) && 1 == ~a21~0 && 4 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 1 == ~a20~0) && 4 == ~a16~0);" "assume !(1 == ~a7~0 && 13 == ~a8~0 && 8 == ~a12~0 && !(1 == ~a21~0) && 2 == calculate_output_~input#1 && (((1 == ~a20~0 && !(1 == ~a17~0)) && 6 == ~a16~0) || ((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0)));" "assume !(((((((!(1 == ~a20~0) && !(1 == ~a17~0) && !(1 == ~a7~0)) && 15 == ~a8~0) && 6 == ~a16~0) && 1 == ~a21~0) || (((13 == ~a8~0 && (1 == ~a17~0 && 1 == ~a7~0) && 1 == ~a20~0) && 4 == ~a16~0) && !(1 == ~a21~0))) && 6 == calculate_output_~input#1) && 8 == ~a12~0);" "assume !((!(1 == ~a7~0) && !(1 == ~a17~0) && (((3 == calculate_output_~input#1 && 1 == ~a21~0) && 4 == ~a16~0) && 15 == ~a8~0) && 8 == ~a12~0) && !(1 == ~a20~0));" "assume !((((8 == ~a12~0 && (((1 == ~a17~0 && !(1 == ~a20~0)) && 4 == ~a16~0) || ((1 == ~a20~0 && !(1 == ~a17~0)) && 5 == ~a16~0) || ((!(1 == ~a17~0) && 1 == ~a20~0) && 6 == ~a16~0)) && 3 == calculate_output_~input#1) && 15 == ~a8~0) && 1 == ~a21~0) && !(1 == ~a7~0));" "assume !(((!(1 == ~a7~0) && (5 == calculate_output_~input#1 && (((5 == ~a16~0 && !(1 == ~a17~0) && 1 == ~a20~0) || (6 == ~a16~0 && 1 == ~a20~0 && !(1 == ~a17~0))) || (4 == ~a16~0 && !(1 == ~a20~0) && 1 == ~a17~0))) && 8 == ~a12~0) && 1 == ~a21~0) && 15 == ~a8~0);" "assume !((!(1 == ~a7~0) && (1 == ~a21~0 && (1 == ~a17~0 && 8 == ~a12~0 && 2 == calculate_output_~input#1) && !(1 == ~a20~0)) && 6 == ~a16~0) && 15 == ~a8~0);" "assume !((!(1 == ~a17~0) && 1 == ~a21~0 && (!(1 == ~a20~0) && 8 == ~a12~0 && 3 == calculate_output_~input#1 && !(1 == ~a7~0)) && 15 == ~a8~0) && 5 == ~a16~0);" "assume (5 == ~a16~0 && !(1 == ~a20~0) && (((6 == calculate_output_~input#1 && 1 == ~a21~0) && 1 == ~a17~0) && !(1 == ~a7~0)) && 8 == ~a12~0) && 15 == ~a8~0;calculate_output_#res#1 := 24;" "main_#t~ret7#1 := calculate_output_#res#1;havoc calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;main_~output~0#1 := main_#t~ret7#1;havoc main_~input~0#1;havoc main_#t~ret7#1;" [2025-03-04 15:48:45,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -342540029, now seen corresponding path program 2 times [2025-03-04 15:48:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:45,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306742539] [2025-03-04 15:48:45,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:48:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:45,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:45,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:45,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:48:45,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:45,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:45,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:45,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:45,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:45,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:45,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:45,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash -422041658, now seen corresponding path program 1 times [2025-03-04 15:48:45,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:45,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523655397] [2025-03-04 15:48:45,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:45,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:45,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 15:48:45,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:48:45,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:45,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:45,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:45,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 15:48:45,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:48:45,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:45,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:45,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:45,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:48:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1524994940, now seen corresponding path program 1 times [2025-03-04 15:48:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:48:45,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229948339] [2025-03-04 15:48:45,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:48:45,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:48:45,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 15:48:45,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 15:48:45,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:45,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:45,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:45,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 15:48:45,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 15:48:45,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:45,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:45,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:48:46,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:46,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:46,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:46,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:46,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:48:46,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:48:46,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:48:46,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:48:46,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:48:46,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:48:46 BoogieIcfgContainer [2025-03-04 15:48:46,463 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:48:46,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:48:46,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:48:46,463 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:48:46,464 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:48:29" (3/4) ... [2025-03-04 15:48:46,467 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 15:48:46,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:48:46,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:48:46,516 INFO L158 Benchmark]: Toolchain (without parser) took 17941.04ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 121.5MB in the beginning and 706.1MB in the end (delta: -584.6MB). Peak memory consumption was 730.1MB. Max. memory is 16.1GB. [2025-03-04 15:48:46,517 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:48:46,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.20ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 95.0MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 15:48:46,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.29ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 90.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:48:46,518 INFO L158 Benchmark]: Boogie Preprocessor took 53.17ms. Allocated memory is still 167.8MB. Free memory was 90.0MB in the beginning and 85.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:48:46,518 INFO L158 Benchmark]: IcfgBuilder took 788.70ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 85.4MB in the end (delta: 498.8kB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2025-03-04 15:48:46,518 INFO L158 Benchmark]: BuchiAutomizer took 16652.12ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 85.4MB in the beginning and 710.3MB in the end (delta: -624.9MB). Peak memory consumption was 696.3MB. Max. memory is 16.1GB. [2025-03-04 15:48:46,518 INFO L158 Benchmark]: Witness Printer took 52.17ms. Allocated memory is still 1.5GB. Free memory was 710.3MB in the beginning and 706.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:48:46,520 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.16ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.20ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 95.0MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.29ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 90.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.17ms. Allocated memory is still 167.8MB. Free memory was 90.0MB in the beginning and 85.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 788.70ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 85.4MB in the end (delta: 498.8kB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 16652.12ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 85.4MB in the beginning and 710.3MB in the end (delta: -624.9MB). Peak memory consumption was 696.3MB. Max. memory is 16.1GB. * Witness Printer took 52.17ms. Allocated memory is still 1.5GB. Free memory was 710.3MB in the beginning and 706.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function a20 and consists of 4 locations. One deterministic module has affine ranking function a8 and consists of 4 locations. One deterministic module has affine ranking function a17 and consists of 4 locations. One deterministic module has affine ranking function a7 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 41570 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 10.1s. Construction of modules took 2.0s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 1.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 4000 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.9s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1335 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1331 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3472 IncrementalHoareTripleChecker+Invalid, 3721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 221 mSDtfsCounter, 3472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT2 conc1 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital44 mio100 ax100 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq208 hnf96 smp100 dnf139 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 593]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\result=24, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) Loop: [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L326] COND TRUE (((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15)) [L327] return 24; [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 593]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\result=24, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) Loop: [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L326] COND TRUE (((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15)) [L327] return 24; [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-04 15:48:46,536 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)