./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/test25-1.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/ldv-regression/test25-1.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 de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:14:19,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:14:19,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:14:19,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:14:19,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:14:19,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:14:19,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:14:19,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:14:19,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:14:19,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:14:19,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:14:19,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:14:19,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:14:19,941 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:14:19,941 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:14:19,941 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:14:19,941 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:14:19,941 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:14:19,941 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:14:19,941 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:14:19,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:14:19,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:14:19,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:14:19,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:14:19,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:14:19,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:14:19,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:14:19,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:14:19,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:14:19,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:14:19,943 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:14:19,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:14:19,943 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:14:19,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:14:19,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:14:19,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:14:19,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:14:19,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:14:19,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:14:19,943 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:14:19,943 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 -> de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 [2025-03-09 07:14:20,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:14:20,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:14:20,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:14:20,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:14:20,172 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:14:20,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test25-1.c [2025-03-09 07:14:21,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8746e5e3c/912f0f16d1f8416d8e1d87f9bffd81c4/FLAGd43b964ee [2025-03-09 07:14:21,598 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:14:21,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c [2025-03-09 07:14:21,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8746e5e3c/912f0f16d1f8416d8e1d87f9bffd81c4/FLAGd43b964ee [2025-03-09 07:14:21,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8746e5e3c/912f0f16d1f8416d8e1d87f9bffd81c4 [2025-03-09 07:14:21,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:14:21,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:14:21,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:14:21,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:14:21,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:14:21,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:14:21" (1/1) ... [2025-03-09 07:14:21,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390b6cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:21, skipping insertion in model container [2025-03-09 07:14:21,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:14:21" (1/1) ... [2025-03-09 07:14:21,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:14:22,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:14:22,070 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:14:22,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:14:22,090 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:14:22,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22 WrapperNode [2025-03-09 07:14:22,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:14:22,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:14:22,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:14:22,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:14:22,095 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:14:22" (1/1) ... [2025-03-09 07:14:22,104 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:14:22" (1/1) ... [2025-03-09 07:14:22,117 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-03-09 07:14:22,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:14:22,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:14:22,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:14:22,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:14:22,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (1/1) ... [2025-03-09 07:14:22,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (1/1) ... [2025-03-09 07:14:22,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (1/1) ... [2025-03-09 07:14:22,142 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 4, 6]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-03-09 07:14:22,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (1/1) ... [2025-03-09 07:14:22,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (1/1) ... [2025-03-09 07:14:22,153 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (1/1) ... [2025-03-09 07:14:22,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (1/1) ... [2025-03-09 07:14:22,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (1/1) ... [2025-03-09 07:14:22,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (1/1) ... [2025-03-09 07:14:22,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:14:22,157 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:14:22,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:14:22,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:14:22,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (1/1) ... [2025-03-09 07:14:22,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:22,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:22,184 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:14:22,186 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:14:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 07:14:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 07:14:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 07:14:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:14:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:14:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:14:22,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 07:14:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 07:14:22,265 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:14:22,266 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:14:22,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: call ULTIMATE.dealloc(main_~#cont~0#1.base, main_~#cont~0#1.offset);havoc main_~#cont~0#1.base, main_~#cont~0#1.offset;call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-03-09 07:14:22,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: havoc check_#t~mem4#1.base, check_#t~mem4#1.offset;havoc check_#t~mem5#1; [2025-03-09 07:14:22,431 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-09 07:14:22,433 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:14:22,441 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:14:22,442 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:14:22,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:14:22 BoogieIcfgContainer [2025-03-09 07:14:22,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:14:22,443 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:14:22,444 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:14:22,448 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:14:22,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:14:22,449 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:14:21" (1/3) ... [2025-03-09 07:14:22,451 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12f040cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:14:22, skipping insertion in model container [2025-03-09 07:14:22,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:14:22,451 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:14:22" (2/3) ... [2025-03-09 07:14:22,451 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12f040cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:14:22, skipping insertion in model container [2025-03-09 07:14:22,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:14:22,451 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:14:22" (3/3) ... [2025-03-09 07:14:22,452 INFO L363 chiAutomizerObserver]: Analyzing ICFG test25-1.c [2025-03-09 07:14:22,497 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:14:22,497 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:14:22,497 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:14:22,497 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:14:22,497 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:14:22,497 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:14:22,497 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:14:22,498 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:14:22,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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:14:22,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2025-03-09 07:14:22,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:22,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:22,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:14:22,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:14:22,520 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:14:22,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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:14:22,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2025-03-09 07:14:22,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:22,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:22,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:14:22,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:14:22,526 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0;" [2025-03-09 07:14:22,527 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-09 07:14:22,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1824, now seen corresponding path program 1 times [2025-03-09 07:14:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:22,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570166601] [2025-03-09 07:14:22,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:22,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:22,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:22,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:22,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:22,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:22,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:22,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:22,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:22,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:22,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:22,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:22,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2025-03-09 07:14:22,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:22,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391540494] [2025-03-09 07:14:22,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:22,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:22,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:14:22,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:14:22,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:22,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:22,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:22,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:14:22,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:14:22,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:22,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:22,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash 56569, now seen corresponding path program 1 times [2025-03-09 07:14:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980106620] [2025-03-09 07:14:22,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:22,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:22,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:22,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:22,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:22,722 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:22,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:14:22,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:14:22,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:22,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:22,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:23,286 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:14:23,287 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:14:23,287 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:14:23,287 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:14:23,287 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:14:23,287 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:23,288 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:14:23,288 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:14:23,288 INFO L132 ssoRankerPreferences]: Filename of dumped script: test25-1.c_Iteration1_Lasso [2025-03-09 07:14:23,288 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:14:23,288 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:14:23,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:14:23,817 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:14:23,820 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:14:23,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:23,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:23,823 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:14:23,825 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:14:23,826 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:14:23,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:23,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:23,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:23,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:23,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:23,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:23,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:23,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:23,857 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:14:23,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:23,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:23,862 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:14:23,864 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:14:23,866 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:14:23,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:23,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:23,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:23,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:23,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:23,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:23,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:23,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:23,884 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:14:23,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:23,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:23,887 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:14:23,888 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:14:23,891 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:14:23,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:23,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:23,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:23,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:23,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:23,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:23,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:23,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:23,910 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:14:23,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:23,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:23,912 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:14:23,914 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:14:23,915 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:14:23,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:23,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:23,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:23,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:23,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:23,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:23,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:23,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:23,935 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:14:23,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:23,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:23,938 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:14:23,951 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:14:23,952 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:14:23,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:23,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:23,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:23,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:23,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:23,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:23,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:23,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:23,973 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:14:23,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:23,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:23,975 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:14:23,976 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:14:23,977 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:14:23,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:23,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:23,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:23,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:23,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:23,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:23,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:23,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:23,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 07:14:23,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:23,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:23,997 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:14:23,998 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:14:24,000 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:14:24,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:24,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:24,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:24,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,031 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:14:24,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,034 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:14:24,036 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:14:24,037 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:14:24,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:24,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:24,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:24,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-09 07:14:24,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,060 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:14:24,063 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:14:24,063 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:14:24,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:24,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:24,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:24,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:24,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,084 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:14:24,085 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:14:24,087 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:14:24,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:24,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:24,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:24,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,105 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:14:24,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,108 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:14:24,110 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:14:24,112 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:14:24,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:24,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:24,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:24,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:24,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,135 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:14:24,137 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:14:24,138 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:14:24,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:24,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:24,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:24,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,162 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:14:24,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,165 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:14:24,173 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:14:24,173 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:14:24,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,213 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:14:24,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,218 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:14:24,221 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:14:24,222 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:14:24,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 07:14:24,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,260 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:14:24,263 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:14:24,263 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:14:24,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:24,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:24,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:24,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,282 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:14:24,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,284 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:14:24,286 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:14:24,287 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:14:24,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,308 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:14:24,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,311 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:14:24,312 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:14:24,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:14:24,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,337 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:14:24,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,339 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:14:24,341 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:14:24,342 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:14:24,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 07:14:24,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,366 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:14:24,367 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:14:24,367 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:14:24,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,383 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 07:14:24,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,393 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:14:24,395 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:14:24,396 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:14:24,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,416 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:14:24,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,419 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:14:24,420 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:14:24,421 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:14:24,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,442 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:14:24,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,445 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:14:24,446 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:14:24,447 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:14:24,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:24,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:24,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:24,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 07:14:24,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,466 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:14:24,467 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:14:24,468 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:14:24,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:24,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,490 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:14:24,492 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:14:24,492 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:14:24,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:24,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:24,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:24,504 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,510 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:14:24,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,512 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:14:24,513 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:14:24,515 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:14:24,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:14:24,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:14:24,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:14:24,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,532 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:14:24,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,534 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:14:24,535 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:14:24,537 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:14:24,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:14:24,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-09 07:14:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,561 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:14:24,563 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:14:24,564 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:14:24,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:14:24,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:14:24,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:14:24,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:14:24,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:14:24,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:14:24,584 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:14:24,602 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 07:14:24,604 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-09 07:14:24,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:14:24,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:24,610 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:14:24,611 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:14:24,613 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:14:24,624 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:14:24,625 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:14:24,625 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#array~0#1.base)_1) = -16*ULTIMATE.start_main_~j~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#array~0#1.base)_1 Supporting invariants [] [2025-03-09 07:14:24,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 07:14:24,658 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 07:14:24,664 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:14:24,664 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:14:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:24,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:24,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:24,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:24,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:24,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:14:24,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:24,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:14:24,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:14:24,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:24,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:24,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:14:24,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:24,719 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:14:24,737 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-09 07:14:24,738 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:14:24,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 23 transitions. Complement of second has 3 states. [2025-03-09 07:14:24,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 07:14:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:14:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-09 07:14:24,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-09 07:14:24,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:14:24,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-09 07:14:24,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:14:24,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-09 07:14:24,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:14:24,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2025-03-09 07:14:24,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:14:24,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 8 states and 10 transitions. [2025-03-09 07:14:24,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-09 07:14:24,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-09 07:14:24,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2025-03-09 07:14:24,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:14:24,782 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-03-09 07:14:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2025-03-09 07:14:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-09 07:14:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-03-09 07:14:24,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-03-09 07:14:24,795 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-03-09 07:14:24,795 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:14:24,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2025-03-09 07:14:24,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:14:24,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:24,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:24,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 07:14:24,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:14:24,796 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#1(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4);" "assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#2(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1;" [2025-03-09 07:14:24,796 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem14#1 := read~int#2(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem14#1;havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1;" [2025-03-09 07:14:24,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:24,799 INFO L85 PathProgramCache]: Analyzing trace with hash 54362550, now seen corresponding path program 1 times [2025-03-09 07:14:24,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:24,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530184698] [2025-03-09 07:14:24,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:24,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:24,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:14:24,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:14:24,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:24,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:24,882 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:14:24,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:24,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530184698] [2025-03-09 07:14:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530184698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:14:24,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:14:24,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:14:24,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643587804] [2025-03-09 07:14:24,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:14:24,885 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:14:24,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:24,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 1 times [2025-03-09 07:14:24,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:24,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738118594] [2025-03-09 07:14:24,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:24,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:24,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:24,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:24,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:24,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:24,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:24,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:24,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:24,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:24,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:24,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:24,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:14:24,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:14:24,930 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:24,936 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-03-09 07:14:24,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-03-09 07:14:24,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:14:24,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2025-03-09 07:14:24,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-09 07:14:24,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-09 07:14:24,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2025-03-09 07:14:24,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:14:24,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-09 07:14:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2025-03-09 07:14:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-09 07:14:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-03-09 07:14:24,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-09 07:14:24,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:14:24,939 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-09 07:14:24,939 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:14:24,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2025-03-09 07:14:24,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:14:24,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:24,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:24,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:14:24,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:14:24,940 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#1(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4);" "assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#2(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1;" [2025-03-09 07:14:24,940 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem14#1 := read~int#2(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem14#1;havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1;" [2025-03-09 07:14:24,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1685270845, now seen corresponding path program 1 times [2025-03-09 07:14:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:24,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910914123] [2025-03-09 07:14:24,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:24,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:24,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:14:24,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:14:24,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:24,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910914123] [2025-03-09 07:14:25,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910914123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:14:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766751272] [2025-03-09 07:14:25,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:25,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:14:25,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:25,033 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:14:25,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-09 07:14:25,092 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:14:25,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:14:25,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:14:25,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:25,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:25,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 07:14:25,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:25,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:14:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:25,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766751272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:14:25,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:14:25,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 07:14:25,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490876446] [2025-03-09 07:14:25,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:14:25,132 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:14:25,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 2 times [2025-03-09 07:14:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:25,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030651019] [2025-03-09 07:14:25,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:14:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:25,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:25,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:25,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:14:25,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:25,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:25,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:25,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:25,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:25,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:25,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:25,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 07:14:25,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 07:14:25,165 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:25,177 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2025-03-09 07:14:25,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2025-03-09 07:14:25,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:14:25,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2025-03-09 07:14:25,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-09 07:14:25,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-09 07:14:25,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2025-03-09 07:14:25,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:14:25,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-09 07:14:25,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2025-03-09 07:14:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-09 07:14:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-03-09 07:14:25,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-09 07:14:25,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 07:14:25,180 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-09 07:14:25,180 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:14:25,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2025-03-09 07:14:25,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:14:25,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:25,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:25,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1] [2025-03-09 07:14:25,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:14:25,180 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#1(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4);" "assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#2(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1;" [2025-03-09 07:14:25,180 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem14#1 := read~int#2(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem14#1;havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1;" [2025-03-09 07:14:25,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2062592886, now seen corresponding path program 2 times [2025-03-09 07:14:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77416024] [2025-03-09 07:14:25,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:14:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:25,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-09 07:14:25,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:14:25,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:14:25,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:25,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:14:25,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77416024] [2025-03-09 07:14:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77416024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:14:25,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731507462] [2025-03-09 07:14:25,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:14:25,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:14:25,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:14:25,348 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:14:25,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-09 07:14:25,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-09 07:14:25,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:14:25,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:14:25,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:14:25,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:14:25,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:14:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:25,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:14:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:14:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731507462] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:14:25,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:14:25,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 07:14:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620540035] [2025-03-09 07:14:25,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:14:25,494 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:14:25,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 3 times [2025-03-09 07:14:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355919155] [2025-03-09 07:14:25,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:14:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:25,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:25,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:25,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:14:25,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:25,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:25,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:25,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:25,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:25,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:25,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:25,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:14:25,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 07:14:25,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 07:14:25,534 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:14:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:14:25,558 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-09 07:14:25,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2025-03-09 07:14:25,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:14:25,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2025-03-09 07:14:25,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-09 07:14:25,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-09 07:14:25,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2025-03-09 07:14:25,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:14:25,560 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-09 07:14:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2025-03-09 07:14:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-09 07:14:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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:14:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-03-09 07:14:25,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-09 07:14:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 07:14:25,562 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-09 07:14:25,563 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:14:25,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2025-03-09 07:14:25,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:14:25,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:14:25,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:14:25,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1] [2025-03-09 07:14:25,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:14:25,563 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < 10;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#2(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume !(main_~j~0#1 < 10);havoc main_~j~0#1;" "assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#1(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4);" "assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#2(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1;" [2025-03-09 07:14:25,563 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem14#1 := read~int#2(main_~pa~0#1.base, main_~pa~0#1.offset, 4);" "assume main_~i~0#1 < main_#t~mem14#1;havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1;" [2025-03-09 07:14:25,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:25,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1289746922, now seen corresponding path program 3 times [2025-03-09 07:14:25,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:25,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296304125] [2025-03-09 07:14:25,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:14:25,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:25,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-03-09 07:14:25,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 07:14:25,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 07:14:25,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:25,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:25,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 07:14:25,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 07:14:25,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:25,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:25,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 4 times [2025-03-09 07:14:25,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:25,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669290349] [2025-03-09 07:14:25,705 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:14:25,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:25,710 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 07:14:25,711 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:25,711 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:14:25,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:25,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:25,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:14:25,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:14:25,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:25,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:25,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:14:25,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:14:25,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1798757077, now seen corresponding path program 1 times [2025-03-09 07:14:25,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:14:25,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238019066] [2025-03-09 07:14:25,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:14:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:14:25,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:14:25,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:14:25,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:25,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:25,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:14:25,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:14:25,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:14:25,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:14:25,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:14:25,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace