./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label00.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 ef0fc431edab04e2bc46b00be67c275761704e057ac7d10029420dfecba76e3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:00:48,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:00:48,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:00:48,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:00:48,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:00:48,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:00:48,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:00:48,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:00:48,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:00:48,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:00:48,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:00:48,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:00:48,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:00:48,389 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:00:48,389 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:00:48,389 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:00:48,389 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:00:48,389 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:00:48,389 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:00:48,389 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:00:48,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:00:48,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:00:48,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:00:48,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:00:48,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:00:48,390 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:00:48,391 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 -> ef0fc431edab04e2bc46b00be67c275761704e057ac7d10029420dfecba76e3a [2025-03-09 07:00:48,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:00:48,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:00:48,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:00:48,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:00:48,601 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:00:48,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2025-03-09 07:00:49,767 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87108bbbc/ff5d9fcb1b874ae8a44710449cbb04d2/FLAG21ac3efb0 [2025-03-09 07:00:50,059 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:00:50,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2025-03-09 07:00:50,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87108bbbc/ff5d9fcb1b874ae8a44710449cbb04d2/FLAG21ac3efb0 [2025-03-09 07:00:50,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87108bbbc/ff5d9fcb1b874ae8a44710449cbb04d2 [2025-03-09 07:00:50,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:00:50,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:00:50,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:00:50,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:00:50,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:00:50,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8b9cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50, skipping insertion in model container [2025-03-09 07:00:50,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:00:50,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:00:50,637 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:00:50,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:00:50,728 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:00:50,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50 WrapperNode [2025-03-09 07:00:50,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:00:50,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:00:50,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:00:50,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:00:50,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,777 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 654 [2025-03-09 07:00:50,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:00:50,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:00:50,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:00:50,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:00:50,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,800 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-09 07:00:50,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:00:50,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:00:50,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:00:50,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:00:50,827 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (1/1) ... [2025-03-09 07:00:50,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:50,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:50,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:50,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:00:50,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:00:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:00:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:00:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:00:50,928 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:00:50,930 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:00:51,793 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-09 07:00:51,793 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:00:51,805 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:00:51,807 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:00:51,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:00:51 BoogieIcfgContainer [2025-03-09 07:00:51,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:00:51,808 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:00:51,809 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:00:51,813 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:00:51,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:00:51,813 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:00:50" (1/3) ... [2025-03-09 07:00:51,814 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f5d90fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:00:51, skipping insertion in model container [2025-03-09 07:00:51,814 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:00:51,814 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:50" (2/3) ... [2025-03-09 07:00:51,814 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f5d90fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:00:51, skipping insertion in model container [2025-03-09 07:00:51,814 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:00:51,814 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:00:51" (3/3) ... [2025-03-09 07:00:51,816 INFO L363 chiAutomizerObserver]: Analyzing ICFG Problem01_label00.c [2025-03-09 07:00:51,854 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:00:51,854 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:00:51,855 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:00:51,855 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:00:51,855 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:00:51,855 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:00:51,855 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:00:51,856 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:00:51,860 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-09 07:00:51,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2025-03-09 07:00:51,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:51,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:51,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:00:51,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 07:00:51,890 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:00:51,890 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-09 07:00:51,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2025-03-09 07:00:51,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:51,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:51,900 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:00:51,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 07:00:51,905 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-09 07:00:51,905 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-09 07:00:51,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash 13568, now seen corresponding path program 1 times [2025-03-09 07:00:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023089821] [2025-03-09 07:00:51,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:51,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:51,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:51,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:51,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:51,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:51,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:51,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:51,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:51,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:51,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:52,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:52,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:52,008 INFO L85 PathProgramCache]: Analyzing trace with hash 12952452, now seen corresponding path program 1 times [2025-03-09 07:00:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:52,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519745937] [2025-03-09 07:00:52,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:52,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:52,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:00:52,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:00:52,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:52,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:52,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:52,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:00:52,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:00:52,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:52,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:52,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:52,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash -342540029, now seen corresponding path program 1 times [2025-03-09 07:00:52,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:52,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790097966] [2025-03-09 07:00:52,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:52,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:00:52,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:00:52,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:52,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:52,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:52,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:00:52,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:00:52,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:52,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:52,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:52,252 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:52,253 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:52,253 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:52,253 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:52,254 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:00:52,254 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,254 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:52,254 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:52,254 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label00.c_Iteration1_Loop [2025-03-09 07:00:52,254 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:52,254 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:52,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,408 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:52,410 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:00:52,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 07:00:52,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,435 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,435 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-09 07:00:52,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:52,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 07:00:52,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,465 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,466 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:52,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 07:00:52,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,475 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 07:00:52,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,492 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,492 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=1} Honda state: {~a17~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:52,498 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-09 07:00:52,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 07:00:52,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,527 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,527 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a16~0=5} Honda state: {~a16~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:52,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 07:00:52,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,537 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 07:00:52,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,550 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,551 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-09 07:00:52,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-09 07:00:52,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 07:00:52,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,572 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,572 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-09 07:00:52,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:52,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,580 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 07:00:52,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,595 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,595 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-09 07:00:52,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:52,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,614 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 07:00:52,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,631 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,631 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-09 07:00:52,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:52,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,639 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 07:00:52,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,661 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,661 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a7~0=4} Honda state: {~a7~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:52,666 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-09 07:00:52,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,668 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 07:00:52,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,682 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,682 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:52,687 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-09 07:00:52,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,689 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 07:00:52,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,702 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:52,702 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=15} Honda state: {~a8~0=15} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:52,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 07:00:52,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,709 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 07:00:52,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:52,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 07:00:52,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,731 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 07:00:52,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:00:52,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:52,745 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:00:52,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:52,753 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:52,753 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:52,753 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:52,753 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:52,753 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:00:52,753 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,753 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:52,753 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:52,753 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label00.c_Iteration1_Loop [2025-03-09 07:00:52,753 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:52,753 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:52,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:52,889 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:52,892 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:00:52,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,894 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 07:00:52,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:52,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:52,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:52,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:52,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:52,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:52,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:52,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:52,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:52,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:52,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,924 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 07:00:52,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:52,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:52,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:52,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:52,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:52,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:52,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:52,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:52,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:52,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:52,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,950 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:52,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 07:00:52,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:52,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:52,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:52,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:52,964 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:00:52,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:52,966 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:00:52,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:52,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:52,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:52,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:52,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:52,977 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-09 07:00:52,981 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-09 07:00:52,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:52,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:52,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:52,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:52,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:52,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:52,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:52,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:52,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:53,003 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-09 07:00:53,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:53,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:53,005 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:53,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 07:00:53,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:53,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:53,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:53,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:53,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:53,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:53,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:53,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:53,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:53,027 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-09 07:00:53,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:53,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:53,029 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:53,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 07:00:53,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:53,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:53,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:53,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:53,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:53,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:53,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:53,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:53,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:53,052 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-09 07:00:53,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:53,054 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:53,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 07:00:53,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:53,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:53,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:53,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:53,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:53,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:53,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:53,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:53,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:53,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:53,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:53,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:53,079 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:53,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 07:00:53,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:53,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:53,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:53,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:53,094 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:00:53,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:53,097 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:00:53,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:53,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:53,105 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-09 07:00:53,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:53,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:53,108 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-09 07:00:53,109 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-09 07:00:53,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:53,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:53,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:53,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:53,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:53,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:53,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:53,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:53,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:53,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:53,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:53,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:53,134 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:53,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 07:00:53,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:53,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:53,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:53,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:53,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:53,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:53,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:53,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:53,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:53,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-09 07:00:53,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:53,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:53,159 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:53,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 07:00:53,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:53,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:53,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:53,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:53,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:53,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:53,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:53,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:53,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:53,180 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-09 07:00:53,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:53,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:53,182 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:53,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 07:00:53,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:53,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:53,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:53,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:53,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:53,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:53,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:53,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:53,204 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:00:53,207 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:00:53,209 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:00:53,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:53,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:53,214 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:53,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 07:00:53,217 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:00:53,217 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:00:53,218 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:00:53,218 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a20~0) = 1*~a20~0 Supporting invariants [] [2025-03-09 07:00:53,226 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-09 07:00:53,228 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:00:53,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:53,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:53,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:53,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:53,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:53,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:00:53,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:53,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:00:53,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:00:53,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:53,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:53,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:00:53,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:00:53,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 07:00:53,363 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:00:53,365 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-09 07:00:53,886 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-09 07:00:53,887 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-09 07:00:53,890 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-09 07:00:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2025-03-09 07:00:53,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 622 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-09 07:00:53,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:53,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 622 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-09 07:00:53,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:53,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 622 transitions. Stem has 2 letters. Loop has 8 letters. [2025-03-09 07:00:53,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:53,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 788 states and 1201 transitions. [2025-03-09 07:00:53,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 324 [2025-03-09 07:00:53,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 788 states to 461 states and 681 transitions. [2025-03-09 07:00:53,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2025-03-09 07:00:53,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2025-03-09 07:00:53,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 681 transitions. [2025-03-09 07:00:53,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:00:53,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 461 states and 681 transitions. [2025-03-09 07:00:53,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 681 transitions. [2025-03-09 07:00:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-03-09 07:00:53,962 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-09 07:00:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 679 transitions. [2025-03-09 07:00:53,964 INFO L240 hiAutomatonCegarLoop]: Abstraction has 459 states and 679 transitions. [2025-03-09 07:00:53,964 INFO L432 stractBuchiCegarLoop]: Abstraction has 459 states and 679 transitions. [2025-03-09 07:00:53,964 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:00:53,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 459 states and 679 transitions. [2025-03-09 07:00:53,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 324 [2025-03-09 07:00:53,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:53,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:53,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:00:53,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:00:53,967 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-09 07:00:53,967 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-09 07:00:53,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash 420999, now seen corresponding path program 1 times [2025-03-09 07:00:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:53,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074445244] [2025-03-09 07:00:53,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:53,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:53,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:00:53,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:00:53,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:53,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:53,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:53,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:00:53,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:00:53,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:53,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:53,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:53,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:53,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1519553970, now seen corresponding path program 1 times [2025-03-09 07:00:53,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:53,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017731119] [2025-03-09 07:00:53,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:53,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:00:53,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:00:53,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:53,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:53,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:53,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:00:54,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:00:54,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:54,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:54,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:54,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:54,011 INFO L85 PathProgramCache]: Analyzing trace with hash 292750088, now seen corresponding path program 1 times [2025-03-09 07:00:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:54,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496295500] [2025-03-09 07:00:54,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:54,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:00:54,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:00:54,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:54,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:54,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:54,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:00:54,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:00:54,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:54,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:54,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:54,160 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:54,160 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:54,160 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:54,160 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:54,160 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:00:54,160 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,160 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:54,160 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:54,160 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label00.c_Iteration2_Loop [2025-03-09 07:00:54,160 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:54,160 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:54,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,314 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:54,315 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:00:54,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,318 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:54,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 07:00:54,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:54,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:54,331 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:54,331 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-09 07:00:54,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:54,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,339 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:54,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 07:00:54,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:54,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:54,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:54,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,367 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:54,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 07:00:54,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:00:54,368 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:54,394 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:00:54,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 07:00:54,399 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:54,399 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:54,399 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:54,399 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:54,399 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:00:54,399 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,399 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:54,399 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:54,399 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label00.c_Iteration2_Loop [2025-03-09 07:00:54,399 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:54,399 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:54,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:54,525 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:54,525 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:00:54,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,528 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:54,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 07:00:54,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:54,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:54,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:54,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:54,551 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:00:54,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:54,553 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:00:54,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:54,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:54,561 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-09 07:00:54,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,563 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-09 07:00:54,565 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-09 07:00:54,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:54,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:54,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:54,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:54,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:54,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:54,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:54,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:54,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:54,585 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-09 07:00:54,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,587 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-09 07:00:54,588 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-09 07:00:54,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:54,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:54,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:54,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:54,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:54,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:54,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:54,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:54,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:54,612 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-09 07:00:54,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,614 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-09 07:00:54,616 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-09 07:00:54,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:54,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:54,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:54,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:54,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:54,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:54,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:54,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:54,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:54,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:54,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,637 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-09 07:00:54,638 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-09 07:00:54,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:54,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:54,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:54,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:54,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:54,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:54,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:54,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:54,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:54,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-09 07:00:54,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,659 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-09 07:00:54,660 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-09 07:00:54,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:54,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:54,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:54,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:54,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:54,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:54,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:54,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:54,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:54,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-09 07:00:54,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,682 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-09 07:00:54,683 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-09 07:00:54,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:54,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:54,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:54,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:54,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:54,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:54,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:54,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:54,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:54,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:54,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,705 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-09 07:00:54,706 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-09 07:00:54,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:54,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:54,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:54,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:54,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:54,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:54,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:54,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:54,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:54,726 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-09 07:00:54,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,728 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-09 07:00:54,730 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-09 07:00:54,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:54,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:54,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:54,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:54,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:54,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:54,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:54,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:54,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:54,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:54,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,751 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-09 07:00:54,752 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-09 07:00:54,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:54,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:54,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:54,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:54,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:54,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:54,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:54,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:54,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:00:54,768 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:00:54,768 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:00:54,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:54,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:54,770 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-09 07:00:54,771 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-09 07:00:54,772 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:00:54,772 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:00:54,772 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:00:54,772 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a8~0) = 1*~a8~0 Supporting invariants [] [2025-03-09 07:00:54,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:54,778 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:00:54,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:54,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:00:54,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:00:54,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:54,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:54,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:00:54,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:54,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:00:54,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:00:54,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:54,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:54,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:00:54,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:00:54,834 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:00:54,835 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-09 07:00:55,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-09 07:00:55,246 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-09 07:00:55,247 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-09 07:00:55,248 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-09 07:00:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2025-03-09 07:00:55,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 630 transitions. Stem has 3 letters. Loop has 7 letters. [2025-03-09 07:00:55,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:55,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 630 transitions. Stem has 10 letters. Loop has 7 letters. [2025-03-09 07:00:55,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:55,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 630 transitions. Stem has 3 letters. Loop has 14 letters. [2025-03-09 07:00:55,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:55,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1571 states and 2220 transitions. [2025-03-09 07:00:55,265 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 586 [2025-03-09 07:00:55,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1571 states to 1256 states and 1717 transitions. [2025-03-09 07:00:55,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 591 [2025-03-09 07:00:55,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2025-03-09 07:00:55,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1256 states and 1717 transitions. [2025-03-09 07:00:55,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:00:55,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1256 states and 1717 transitions. [2025-03-09 07:00:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states and 1717 transitions. [2025-03-09 07:00:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1253. [2025-03-09 07:00:55,298 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-09 07:00:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1714 transitions. [2025-03-09 07:00:55,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1253 states and 1714 transitions. [2025-03-09 07:00:55,302 INFO L432 stractBuchiCegarLoop]: Abstraction has 1253 states and 1714 transitions. [2025-03-09 07:00:55,302 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:00:55,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1253 states and 1714 transitions. [2025-03-09 07:00:55,306 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 586 [2025-03-09 07:00:55,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:55,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:55,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:00:55,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:00:55,307 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-09 07:00:55,307 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-09 07:00:55,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:55,308 INFO L85 PathProgramCache]: Analyzing trace with hash 13051359, now seen corresponding path program 1 times [2025-03-09 07:00:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:55,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594494894] [2025-03-09 07:00:55,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:55,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:55,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:00:55,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:00:55,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:55,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:55,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:55,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:00:55,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:00:55,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:55,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:55,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:55,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:55,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2036778729, now seen corresponding path program 1 times [2025-03-09 07:00:55,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:55,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977416629] [2025-03-09 07:00:55,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:55,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:55,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:00:55,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:00:55,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:55,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:55,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:55,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:00:55,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:00:55,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:55,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:55,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:55,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash -356791047, now seen corresponding path program 1 times [2025-03-09 07:00:55,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:55,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601424179] [2025-03-09 07:00:55,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:55,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:55,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:00:55,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:00:55,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:55,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:55,437 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-09 07:00:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:00:55,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601424179] [2025-03-09 07:00:55,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601424179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:00:55,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:00:55,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:00:55,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377137250] [2025-03-09 07:00:55,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:00:55,582 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:55,582 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:55,582 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:55,582 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:55,583 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:00:55,583 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:55,583 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:55,583 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:55,583 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label00.c_Iteration3_Loop [2025-03-09 07:00:55,583 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:55,583 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:55,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,728 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:55,728 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:00:55,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:55,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:55,731 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-09 07:00:55,733 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-09 07:00:55,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:55,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:55,745 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:55,745 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:55,750 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-09 07:00:55,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:55,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:55,753 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-09 07:00:55,754 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-09 07:00:55,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:55,756 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:55,767 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:55,767 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=15} Honda state: {~a8~0=15} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:55,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-09 07:00:55,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:55,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:55,775 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-09 07:00:55,778 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-09 07:00:55,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:55,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:55,791 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:55,791 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-09 07:00:55,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:55,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:55,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:55,798 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-09 07:00:55,799 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-09 07:00:55,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:55,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:55,810 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:55,810 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-09 07:00:55,816 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-09 07:00:55,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:55,818 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-09 07:00:55,819 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-09 07:00:55,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:55,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:55,830 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:55,830 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:55,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-09 07:00:55,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:55,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:55,838 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-09 07:00:55,838 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-09 07:00:55,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:55,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:55,855 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-09 07:00:55,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:55,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:55,857 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-09 07:00:55,858 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-09 07:00:55,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:00:55,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:55,870 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:00:55,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:55,876 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:55,876 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:55,876 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:55,876 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:55,876 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:00:55,876 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:55,876 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:55,876 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:55,876 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label00.c_Iteration3_Loop [2025-03-09 07:00:55,876 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:55,876 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:55,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:55,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:56,022 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:56,022 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:00:56,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:56,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:56,026 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-09 07:00:56,027 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-09 07:00:56,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:56,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:56,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:56,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:56,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:56,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:56,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:56,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:56,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:56,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-09 07:00:56,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:56,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:56,047 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-09 07:00:56,049 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-09 07:00:56,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:56,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:56,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:56,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:56,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:56,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:56,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:56,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:56,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:56,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:56,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:56,067 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-09 07:00:56,067 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-09 07:00:56,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:56,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:56,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:56,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:56,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:56,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:56,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:56,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:56,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:56,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-09 07:00:56,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:56,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:56,086 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-09 07:00:56,087 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-09 07:00:56,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:56,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:56,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:56,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:56,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:56,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:56,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:56,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:56,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:56,104 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-09 07:00:56,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:56,106 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-09 07:00:56,107 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-09 07:00:56,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:56,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:56,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:56,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:56,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:56,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:56,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:56,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:56,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:56,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-09 07:00:56,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:56,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:56,126 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-09 07:00:56,127 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-09 07:00:56,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:56,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:56,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:56,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:56,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:56,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:56,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:56,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:56,140 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:00:56,141 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 07:00:56,141 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:00:56,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:56,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:56,143 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-09 07:00:56,144 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-09 07:00:56,144 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:00:56,144 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:00:56,145 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:00:56,145 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a17~0) = 1*~a17~0 Supporting invariants [] [2025-03-09 07:00:56,150 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-09 07:00:56,151 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:00:56,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:56,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:00:56,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:00:56,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:56,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:56,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:00:56,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:56,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:00:56,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:00:56,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:56,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:56,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:00:56,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:00:56,209 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:00:56,209 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-09 07:00:56,599 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-09 07:00:56,599 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-09 07:00:56,600 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-09 07:00:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 608 transitions. [2025-03-09 07:00:56,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 608 transitions. Stem has 4 letters. Loop has 9 letters. [2025-03-09 07:00:56,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:56,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 608 transitions. Stem has 13 letters. Loop has 9 letters. [2025-03-09 07:00:56,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:56,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 608 transitions. Stem has 4 letters. Loop has 18 letters. [2025-03-09 07:00:56,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:56,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4230 states and 5475 transitions. [2025-03-09 07:00:56,626 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1110 [2025-03-09 07:00:56,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4230 states to 3915 states and 4972 transitions. [2025-03-09 07:00:56,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1121 [2025-03-09 07:00:56,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1126 [2025-03-09 07:00:56,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3915 states and 4972 transitions. [2025-03-09 07:00:56,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:00:56,646 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3915 states and 4972 transitions. [2025-03-09 07:00:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states and 4972 transitions. [2025-03-09 07:00:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3908. [2025-03-09 07:00:56,692 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-09 07:00:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 4965 transitions. [2025-03-09 07:00:56,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3908 states and 4965 transitions. [2025-03-09 07:00:56,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:00:56,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:00:56,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:00:56,705 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-09 07:00:56,914 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-09 07:00:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:00:57,154 INFO L93 Difference]: Finished difference Result 7329 states and 8838 transitions. [2025-03-09 07:00:57,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7329 states and 8838 transitions. [2025-03-09 07:00:57,186 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2096 [2025-03-09 07:00:57,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7329 states to 7268 states and 8746 transitions. [2025-03-09 07:00:57,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2107 [2025-03-09 07:00:57,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2107 [2025-03-09 07:00:57,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7268 states and 8746 transitions. [2025-03-09 07:00:57,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:00:57,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7268 states and 8746 transitions. [2025-03-09 07:00:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states and 8746 transitions. [2025-03-09 07:00:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 7268. [2025-03-09 07:00:57,310 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-09 07:00:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 8746 transitions. [2025-03-09 07:00:57,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7268 states and 8746 transitions. [2025-03-09 07:00:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:00:57,332 INFO L432 stractBuchiCegarLoop]: Abstraction has 7268 states and 8746 transitions. [2025-03-09 07:00:57,332 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:00:57,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7268 states and 8746 transitions. [2025-03-09 07:00:57,355 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2096 [2025-03-09 07:00:57,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:57,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:57,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 07:00:57,356 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-09 07:00:57,356 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-09 07:00:57,357 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-09 07:00:57,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:57,357 INFO L85 PathProgramCache]: Analyzing trace with hash 404592514, now seen corresponding path program 1 times [2025-03-09 07:00:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:57,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408684228] [2025-03-09 07:00:57,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:57,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:57,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:00:57,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:00:57,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:57,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:57,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:57,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:00:57,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:00:57,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:57,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:57,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:57,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:57,375 INFO L85 PathProgramCache]: Analyzing trace with hash 844816958, now seen corresponding path program 1 times [2025-03-09 07:00:57,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:57,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373573795] [2025-03-09 07:00:57,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:57,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:57,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 07:00:57,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 07:00:57,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:57,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:57,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:57,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 07:00:57,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 07:00:57,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:57,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:57,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:57,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1102465343, now seen corresponding path program 1 times [2025-03-09 07:00:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110741430] [2025-03-09 07:00:57,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:57,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 07:00:57,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 07:00:57,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:57,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:57,580 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-09 07:00:57,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:00:57,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110741430] [2025-03-09 07:00:57,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110741430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:00:57,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:00:57,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 07:00:57,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816330830] [2025-03-09 07:00:57,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:00:57,962 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:57,962 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:57,962 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:57,962 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:57,962 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:00:57,962 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:57,962 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:57,962 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:57,962 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label00.c_Iteration4_Loop [2025-03-09 07:00:57,962 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:57,962 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:57,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:57,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,110 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:58,110 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:00:58,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,112 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-09 07:00:58,114 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-09 07:00:58,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:58,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:58,126 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:58,126 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a12~0=8} Honda state: {~a12~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:58,131 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-09 07:00:58,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,134 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-09 07:00:58,135 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-09 07:00:58,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:58,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:58,154 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:58,154 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-09 07:00:58,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-09 07:00:58,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,161 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-09 07:00:58,162 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-09 07:00:58,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:58,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:58,174 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:58,174 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a8~0=13} Honda state: {~a8~0=13} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:00:58,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-09 07:00:58,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,182 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-09 07:00:58,183 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-09 07:00:58,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:58,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:58,201 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-09 07:00:58,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,203 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-09 07:00:58,203 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-09 07:00:58,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:00:58,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:58,216 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:00:58,222 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-09 07:00:58,222 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:58,222 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:58,222 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:58,222 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:58,222 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:00:58,222 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,222 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:58,222 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:58,222 INFO L132 ssoRankerPreferences]: Filename of dumped script: Problem01_label00.c_Iteration4_Loop [2025-03-09 07:00:58,222 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:58,222 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:58,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:58,361 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:58,361 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:00:58,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,364 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-09 07:00:58,365 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-09 07:00:58,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-09 07:00:58,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:58,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:58,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:58,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:58,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:58,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:58,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:58,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:58,386 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-09 07:00:58,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,388 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-09 07:00:58,388 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-09 07:00:58,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-09 07:00:58,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:58,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:58,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:58,400 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-03-09 07:00:58,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:58,404 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-09 07:00:58,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:58,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:58,414 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-09 07:00:58,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,416 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-09 07:00:58,417 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-09 07:00:58,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:58,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:58,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:58,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:58,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:58,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:58,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:58,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:58,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:58,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-09 07:00:58,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,437 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-09 07:00:58,441 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-09 07:00:58,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:58,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:58,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:58,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:58,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:58,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:58,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:58,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:58,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:58,458 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-09 07:00:58,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,460 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-09 07:00:58,463 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-09 07:00:58,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:58,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:58,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:58,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:58,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:58,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:58,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:58,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:58,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:00:58,479 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 07:00:58,480 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:00:58,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:58,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:58,482 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-09 07:00:58,483 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-09 07:00:58,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:00:58,485 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:00:58,485 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:00:58,485 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~a7~0) = 1*~a7~0 Supporting invariants [] [2025-03-09 07:00:58,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-09 07:00:58,491 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:00:58,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:58,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:00:58,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:00:58,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:58,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:58,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:00:58,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:58,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 07:00:58,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 07:00:58,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:58,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:58,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:00:58,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:00:58,637 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:00:58,637 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-09 07:00:58,972 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-09 07:00:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 07:00:58,973 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-09 07:00:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-03-09 07:00:58,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 5 letters. Loop has 68 letters. [2025-03-09 07:00:58,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:58,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 73 letters. Loop has 68 letters. [2025-03-09 07:00:58,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:58,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 5 letters. Loop has 136 letters. [2025-03-09 07:00:58,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:58,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24257 states and 28318 transitions. [2025-03-09 07:00:59,093 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 4192 [2025-03-09 07:00:59,098 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-09 07:00:59,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24257 states to 24257 states and 28318 transitions. [2025-03-09 07:00:59,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4231 [2025-03-09 07:00:59,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4243 [2025-03-09 07:00:59,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24257 states and 28318 transitions. [2025-03-09 07:00:59,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:00:59,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24257 states and 28318 transitions. [2025-03-09 07:00:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24257 states and 28318 transitions. [2025-03-09 07:00:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24257 to 24234. [2025-03-09 07:00:59,435 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-09 07:00:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24234 states to 24234 states and 28295 transitions. [2025-03-09 07:00:59,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24234 states and 28295 transitions. [2025-03-09 07:00:59,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:00:59,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:00:59,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:00:59,486 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-09 07:00:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:00:59,946 INFO L93 Difference]: Finished difference Result 48032 states and 54853 transitions. [2025-03-09 07:00:59,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48032 states and 54853 transitions. [2025-03-09 07:01:00,078 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 8384 [2025-03-09 07:01:00,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48032 states to 45131 states and 51547 transitions. [2025-03-09 07:01:00,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8441 [2025-03-09 07:01:00,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8441 [2025-03-09 07:01:00,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45131 states and 51547 transitions. [2025-03-09 07:01:00,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:01:00,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45131 states and 51547 transitions. [2025-03-09 07:01:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45131 states and 51547 transitions. [2025-03-09 07:01:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45131 to 41166. [2025-03-09 07:01:00,788 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-09 07:01:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41166 states to 41166 states and 47261 transitions. [2025-03-09 07:01:00,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41166 states and 47261 transitions. [2025-03-09 07:01:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:01:00,856 INFO L432 stractBuchiCegarLoop]: Abstraction has 41166 states and 47261 transitions. [2025-03-09 07:01:00,856 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:01:00,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41166 states and 47261 transitions. [2025-03-09 07:01:00,918 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-09 07:01:00,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:01:00,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:01:00,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 07:01:00,919 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-09 07:01:00,919 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-09 07:01:00,920 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-09 07:01:00,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:01:00,921 INFO L85 PathProgramCache]: Analyzing trace with hash 404592514, now seen corresponding path program 2 times [2025-03-09 07:01:00,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:01:00,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804309628] [2025-03-09 07:01:00,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:01:00,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:01:00,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:01:00,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:01:00,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:01:00,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:00,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:01:00,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:01:00,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:01:00,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:00,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:00,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:01:00,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:01:00,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1286146914, now seen corresponding path program 1 times [2025-03-09 07:01:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:01:00,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033083927] [2025-03-09 07:01:00,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:01:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:01:00,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-09 07:01:01,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-09 07:01:01,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:01,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:01,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:01:01,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-09 07:01:01,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-09 07:01:01,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:01,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:01,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:01:01,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:01:01,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1155385409, now seen corresponding path program 1 times [2025-03-09 07:01:01,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:01:01,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992606850] [2025-03-09 07:01:01,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:01:01,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:01:01,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-09 07:01:01,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-09 07:01:01,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:01,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:01:02,361 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-09 07:01:02,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:01:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992606850] [2025-03-09 07:01:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992606850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:01:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:01:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 07:01:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116573860] [2025-03-09 07:01:02,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:01:06,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:01:06,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 07:01:06,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-09 07:01:06,654 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-09 07:01:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:01:07,427 INFO L93 Difference]: Finished difference Result 42262 states and 48369 transitions. [2025-03-09 07:01:07,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42262 states and 48369 transitions. [2025-03-09 07:01:07,553 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-09 07:01:07,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42262 states to 41570 states and 47677 transitions. [2025-03-09 07:01:07,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7384 [2025-03-09 07:01:07,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7384 [2025-03-09 07:01:07,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41570 states and 47677 transitions. [2025-03-09 07:01:07,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:01:07,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41570 states and 47677 transitions. [2025-03-09 07:01:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41570 states and 47677 transitions. [2025-03-09 07:01:08,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41570 to 41570. [2025-03-09 07:01:08,044 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-09 07:01:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41570 states to 41570 states and 47677 transitions. [2025-03-09 07:01:08,097 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41570 states and 47677 transitions. [2025-03-09 07:01:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 07:01:08,100 INFO L432 stractBuchiCegarLoop]: Abstraction has 41570 states and 47677 transitions. [2025-03-09 07:01:08,100 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:01:08,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41570 states and 47677 transitions. [2025-03-09 07:01:08,170 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 7336 [2025-03-09 07:01:08,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:01:08,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:01:08,171 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:01:08,172 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-09 07:01:08,172 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-09 07:01:08,173 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-09 07:01:08,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:01:08,176 INFO L85 PathProgramCache]: Analyzing trace with hash -342540029, now seen corresponding path program 2 times [2025-03-09 07:01:08,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:01:08,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243506231] [2025-03-09 07:01:08,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:01:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:01:08,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:01:08,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:01:08,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:01:08,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:08,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:01:08,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:01:08,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:01:08,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:08,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:08,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:01:08,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:01:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash -422041658, now seen corresponding path program 1 times [2025-03-09 07:01:08,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:01:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687508984] [2025-03-09 07:01:08,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:01:08,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:01:08,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 07:01:08,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 07:01:08,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:08,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:08,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:01:08,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 07:01:08,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 07:01:08,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:08,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:08,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:01:08,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:01:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1524994940, now seen corresponding path program 1 times [2025-03-09 07:01:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:01:08,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162070545] [2025-03-09 07:01:08,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:01:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:01:08,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 07:01:08,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 07:01:08,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:08,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:08,235 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:01:08,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 07:01:08,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 07:01:08,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:08,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:08,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:01:08,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:01:08,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:01:08,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:08,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:08,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:01:08,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:01:08,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:01:08,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:01:08,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:01:08,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:01:08 BoogieIcfgContainer [2025-03-09 07:01:08,794 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:01:08,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:01:08,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:01:08,795 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:01:08,796 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:00:51" (3/4) ... [2025-03-09 07:01:08,797 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 07:01:08,835 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 07:01:08,835 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:01:08,836 INFO L158 Benchmark]: Toolchain (without parser) took 18494.57ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 104.3MB in the beginning and 280.3MB in the end (delta: -176.1MB). Peak memory consumption was 551.6MB. Max. memory is 16.1GB. [2025-03-09 07:01:08,836 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:01:08,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.11ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 78.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 07:01:08,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.15ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 72.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:01:08,838 INFO L158 Benchmark]: Boogie Preprocessor took 42.62ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 68.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:01:08,839 INFO L158 Benchmark]: IcfgBuilder took 987.02ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 53.3MB in the end (delta: 15.4MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-03-09 07:01:08,839 INFO L158 Benchmark]: BuchiAutomizer took 16986.02ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 53.3MB in the beginning and 284.3MB in the end (delta: -231.1MB). Peak memory consumption was 501.6MB. Max. memory is 16.1GB. [2025-03-09 07:01:08,839 INFO L158 Benchmark]: Witness Printer took 40.04ms. Allocated memory is still 872.4MB. Free memory was 284.3MB in the beginning and 280.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:01:08,840 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.11ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 78.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.15ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 72.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.62ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 68.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 987.02ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 53.3MB in the end (delta: 15.4MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 16986.02ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 53.3MB in the beginning and 284.3MB in the end (delta: -231.1MB). Peak memory consumption was 501.6MB. Max. memory is 16.1GB. * Witness Printer took 40.04ms. Allocated memory is still 872.4MB. Free memory was 284.3MB in the beginning and 280.3MB in the end (delta: 4.0MB). 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.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 10.4s. Construction of modules took 2.1s. Büchi inclusion checks took 3.3s. 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.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1331 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3472 IncrementalHoareTripleChecker+Invalid, 3721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 221 mSDtfsCounter, 3472 mSolverCounterSat, 0.1s 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: 22ms 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-09 07:01:08,856 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)