./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:24:28,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:24:28,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:24:28,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:24:28,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:24:28,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:24:29,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:24:29,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:24:29,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:24:29,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:24:29,013 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:24:29,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:24:29,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:24:29,013 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:24:29,013 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:24:29,014 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:24:29,014 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:24:29,014 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:24:29,014 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:24:29,014 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:24:29,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:24:29,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:24:29,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:24:29,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:24:29,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:24:29,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:24:29,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:24:29,015 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:24:29,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:24:29,015 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:24:29,015 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:24:29,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:24:29,016 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:24:29,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:24:29,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:24:29,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:24:29,016 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:24:29,016 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 [2025-02-08 14:24:29,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:24:29,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:24:29,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:24:29,302 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:24:29,303 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:24:29,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2025-02-08 14:24:30,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dabdca8f/3d457dfdfa624601a9a3a1e78b29292a/FLAG58fb2efbd [2025-02-08 14:24:30,857 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:24:30,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2025-02-08 14:24:30,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dabdca8f/3d457dfdfa624601a9a3a1e78b29292a/FLAG58fb2efbd [2025-02-08 14:24:30,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4dabdca8f/3d457dfdfa624601a9a3a1e78b29292a [2025-02-08 14:24:30,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:24:30,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:24:30,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:24:30,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:24:30,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:24:30,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:24:30" (1/1) ... [2025-02-08 14:24:30,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31498961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:30, skipping insertion in model container [2025-02-08 14:24:30,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:24:30" (1/1) ... [2025-02-08 14:24:30,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:24:31,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:24:31,115 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:24:31,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:24:31,188 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:24:31,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31 WrapperNode [2025-02-08 14:24:31,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:24:31,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:24:31,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:24:31,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:24:31,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,216 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-02-08 14:24:31,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:24:31,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:24:31,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:24:31,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:24:31,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,235 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [1, 2, 3]. [2025-02-08 14:24:31,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:24:31,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:24:31,247 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:24:31,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:24:31,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (1/1) ... [2025-02-08 14:24:31,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:31,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:31,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:31,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:24:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:24:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:24:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:24:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:24:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:24:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:24:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:24:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:24:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:24:31,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:24:31,386 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:24:31,388 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:24:31,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;havoc main_#t~ret13#1; [2025-02-08 14:24:31,532 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L562: havoc test_fun_#t~mem10#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset; [2025-02-08 14:24:31,544 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-08 14:24:31,547 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:24:31,556 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:24:31,557 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:24:31,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:24:31 BoogieIcfgContainer [2025-02-08 14:24:31,558 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:24:31,558 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:24:31,559 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:24:31,564 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:24:31,565 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:24:31,565 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:24:30" (1/3) ... [2025-02-08 14:24:31,566 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59abe2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:24:31, skipping insertion in model container [2025-02-08 14:24:31,567 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:24:31,567 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:31" (2/3) ... [2025-02-08 14:24:31,567 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59abe2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:24:31, skipping insertion in model container [2025-02-08 14:24:31,567 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:24:31,567 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:24:31" (3/3) ... [2025-02-08 14:24:31,568 INFO L363 chiAutomizerObserver]: Analyzing ICFG c.08-alloca.i [2025-02-08 14:24:31,616 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:24:31,616 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:24:31,616 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:24:31,616 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:24:31,617 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:24:31,617 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:24:31,617 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:24:31,617 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:24:31,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-02-08 14:24:31,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:24:31,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:31,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:31,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:24:31,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:24:31,643 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:24:31,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-02-08 14:24:31,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:24:31,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:31,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:31,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:24:31,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:24:31,650 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#1(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" [2025-02-08 14:24:31,650 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" "assume !true;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" [2025-02-08 14:24:31,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2025-02-08 14:24:31,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:31,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817542145] [2025-02-08 14:24:31,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:31,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:31,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:24:31,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:24:31,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:31,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:31,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:31,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:24:31,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:24:31,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:31,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:31,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:31,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:31,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1476506, now seen corresponding path program 1 times [2025-02-08 14:24:31,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:31,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942673580] [2025-02-08 14:24:31,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:31,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:31,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:24:31,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:24:31,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:31,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:31,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:24:31,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942673580] [2025-02-08 14:24:31,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942673580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:24:31,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:24:31,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:24:31,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358294310] [2025-02-08 14:24:31,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:24:31,874 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:24:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:24:31,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 14:24:31,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 14:24:31,897 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-02-08 14:24:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:24:31,902 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2025-02-08 14:24:31,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2025-02-08 14:24:31,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:24:31,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 6 states and 7 transitions. [2025-02-08 14:24:31,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-02-08 14:24:31,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-02-08 14:24:31,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2025-02-08 14:24:31,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:24:31,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2025-02-08 14:24:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2025-02-08 14:24:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-02-08 14:24:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-02-08 14:24:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2025-02-08 14:24:31,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2025-02-08 14:24:31,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 14:24:31,928 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2025-02-08 14:24:31,929 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:24:31,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2025-02-08 14:24:31,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:24:31,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:31,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:31,929 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:24:31,929 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-08 14:24:31,929 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#1(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" [2025-02-08 14:24:31,930 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" [2025-02-08 14:24:31,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2025-02-08 14:24:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:31,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311456294] [2025-02-08 14:24:31,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:24:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:31,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:24:31,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:24:31,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:24:31,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:31,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:31,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:24:31,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:24:31,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:31,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:31,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:31,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:31,996 INFO L85 PathProgramCache]: Analyzing trace with hash 45770825, now seen corresponding path program 1 times [2025-02-08 14:24:31,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:31,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975197647] [2025-02-08 14:24:31,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:32,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:24:32,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:24:32,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:32,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:32,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:32,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:24:32,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:24:32,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:32,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:32,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:32,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1477228375, now seen corresponding path program 1 times [2025-02-08 14:24:32,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:32,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614557692] [2025-02-08 14:24:32,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:32,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:32,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:24:32,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:24:32,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:32,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:32,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:32,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:24:32,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:24:32,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:32,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:32,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:32,790 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:24:32,791 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:24:32,791 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:24:32,791 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:24:32,791 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:24:32,791 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:32,791 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:24:32,791 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:24:32,792 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration2_Lasso [2025-02-08 14:24:32,792 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:24:32,792 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:24:32,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:32,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:32,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:32,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:32,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:33,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:33,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:33,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:33,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:33,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:33,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:33,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:33,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:33,700 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:24:33,704 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:24:33,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:33,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:33,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:33,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:24:33,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:24:33,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:33,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:33,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:33,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:33,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:33,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:33,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:33,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:33,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-08 14:24:33,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:33,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:33,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:33,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:24:33,747 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-02-08 14:24:33,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:33,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:33,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:33,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:33,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:33,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:33,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:33,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:33,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:33,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:33,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:33,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:33,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:24:33,770 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-02-08 14:24:33,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:33,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:33,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:33,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:33,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:33,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:33,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:33,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:33,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:33,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:33,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:33,792 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:33,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:24:33,794 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-02-08 14:24:33,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:33,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:33,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:33,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:33,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:33,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:33,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:33,806 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:33,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-08 14:24:33,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:33,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:33,816 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:33,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:24:33,818 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-02-08 14:24:33,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:33,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:33,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:33,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:33,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:33,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:33,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:33,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-08 14:24:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:33,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:33,849 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:33,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:24:33,852 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-02-08 14:24:33,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:33,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:33,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:33,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:33,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:33,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:33,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:33,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-08 14:24:33,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:33,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:33,889 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:33,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:24:33,892 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-02-08 14:24:33,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:33,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:33,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:33,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:33,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:33,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:33,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:33,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-08 14:24:33,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:33,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:33,938 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:33,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:24:33,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-02-08 14:24:33,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:33,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:33,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:33,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:33,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:33,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:33,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:33,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-08 14:24:33,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:33,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:33,982 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:33,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:24:33,985 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-02-08 14:24:33,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:33,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:33,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:33,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:33,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:34,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:34,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:34,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-08 14:24:34,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:34,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:34,016 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:34,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:24:34,019 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-02-08 14:24:34,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:34,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:34,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:34,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:34,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:34,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:34,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:34,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:34,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:34,049 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:34,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:24:34,052 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-02-08 14:24:34,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:34,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:34,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:34,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:34,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:34,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:34,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:34,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-08 14:24:34,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:34,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:34,078 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:34,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:24:34,081 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-02-08 14:24:34,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:34,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:34,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:34,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:34,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:34,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:34,108 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:24:34,129 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-08 14:24:34,133 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-08 14:24:34,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:34,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:34,139 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:34,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:24:34,141 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:24:34,153 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:24:34,153 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:24:34,154 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~i_ref~0#1.base) 0)_1) = 2*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~i_ref~0#1.base) 0)_1 + 1 Supporting invariants [] [2025-02-08 14:24:34,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:34,237 INFO L156 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2025-02-08 14:24:34,247 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 14:24:34,248 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 14:24:34,248 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] [2025-02-08 14:24:34,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:34,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:24:34,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:24:34,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:34,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:34,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:24:34,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:34,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:24:34,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:24:34,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:34,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:34,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:24:34,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:34,388 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-08 14:24:34,391 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:24:34,467 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11 states and 14 transitions. Complement of second has 6 states. [2025-02-08 14:24:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:24:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:24:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-02-08 14:24:34,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 1 letters. Loop has 5 letters. [2025-02-08 14:24:34,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:34,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 5 letters. [2025-02-08 14:24:34,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:34,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 1 letters. Loop has 10 letters. [2025-02-08 14:24:34,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:34,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2025-02-08 14:24:34,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:24:34,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 13 transitions. [2025-02-08 14:24:34,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-08 14:24:34,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-02-08 14:24:34,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2025-02-08 14:24:34,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:24:34,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-02-08 14:24:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2025-02-08 14:24:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-08 14:24:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:24:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2025-02-08 14:24:34,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-02-08 14:24:34,483 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-02-08 14:24:34,483 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:24:34,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2025-02-08 14:24:34,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:24:34,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:34,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:34,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:24:34,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:24:34,486 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#1(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" [2025-02-08 14:24:34,487 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" [2025-02-08 14:24:34,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:34,487 INFO L85 PathProgramCache]: Analyzing trace with hash 49586, now seen corresponding path program 1 times [2025-02-08 14:24:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:34,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662939783] [2025-02-08 14:24:34,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:34,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:34,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:24:34,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:24:34,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:34,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:34,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:34,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:24:34,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:24:34,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:34,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:34,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:34,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:34,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 1 times [2025-02-08 14:24:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:34,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099159874] [2025-02-08 14:24:34,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:34,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:34,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:34,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:34,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:34,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:34,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:34,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:34,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:34,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:34,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:34,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash 47652529, now seen corresponding path program 1 times [2025-02-08 14:24:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:34,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835304343] [2025-02-08 14:24:34,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:34,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:24:34,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:24:34,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:34,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:34,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:34,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:24:34,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:24:34,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:34,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:34,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:34,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-08 14:24:35,085 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:24:35,085 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:24:35,085 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:24:35,085 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:24:35,086 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:24:35,086 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:35,086 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:24:35,086 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:24:35,086 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration3_Lasso [2025-02-08 14:24:35,086 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:24:35,086 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:24:35,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:35,666 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:24:35,666 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:24:35,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:35,668 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:35,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:24:35,671 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-02-08 14:24:35,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:35,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:35,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:35,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:35,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:35,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:35,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:35,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:35,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:35,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:35,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:35,693 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:35,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:24:35,696 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-02-08 14:24:35,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:35,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:35,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:35,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:35,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:35,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:35,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:35,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-08 14:24:35,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:35,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:35,724 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:35,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:24:35,728 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-02-08 14:24:35,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:35,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:35,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:35,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:35,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:35,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:35,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:35,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-08 14:24:35,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:35,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:35,762 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:35,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:24:35,765 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-02-08 14:24:35,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:35,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:35,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:35,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:35,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:35,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:35,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:35,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:35,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:35,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:35,798 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:35,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-08 14:24:35,802 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-02-08 14:24:35,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:35,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:35,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:35,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:35,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:35,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:35,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:24:35,833 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-08 14:24:35,833 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-08 14:24:35,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:35,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:35,836 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:35,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-08 14:24:35,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:24:35,849 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:24:35,849 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:24:35,849 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2, v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2) = -1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2 + 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2 Supporting invariants [] [2025-02-08 14:24:35,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:35,900 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2025-02-08 14:24:35,902 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 14:24:35,902 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 14:24:35,902 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] [2025-02-08 14:24:35,902 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 14:24:35,902 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 14:24:35,902 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] [2025-02-08 14:24:35,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:35,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:24:35,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:24:35,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:35,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:35,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:24:35,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:35,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:35,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:35,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:35,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:35,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:24:35,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:35,975 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:24:35,976 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 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-02-08 14:24:36,006 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. 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) Result 27 states and 33 transitions. Complement of second has 7 states. [2025-02-08 14:24:36,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:24:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-08 14:24:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:24:36,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-08 14:24:36,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:36,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-08 14:24:36,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:36,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-08 14:24:36,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:36,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2025-02-08 14:24:36,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:24:36,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 22 transitions. [2025-02-08 14:24:36,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-02-08 14:24:36,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-02-08 14:24:36,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2025-02-08 14:24:36,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:24:36,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-08 14:24:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2025-02-08 14:24:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2025-02-08 14:24:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) 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-02-08 14:24:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-02-08 14:24:36,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-02-08 14:24:36,014 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-02-08 14:24:36,014 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:24:36,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2025-02-08 14:24:36,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:24:36,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:36,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:36,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-02-08 14:24:36,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:24:36,016 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#1(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" [2025-02-08 14:24:36,016 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" [2025-02-08 14:24:36,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2017706026, now seen corresponding path program 2 times [2025-02-08 14:24:36,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:36,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107741021] [2025-02-08 14:24:36,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:24:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:36,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-08 14:24:36,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:24:36,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:24:36,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:24:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107741021] [2025-02-08 14:24:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107741021] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:24:36,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211604464] [2025-02-08 14:24:36,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:24:36,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:24:36,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:36,306 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:24:36,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-08 14:24:36,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-08 14:24:36,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-08 14:24:36,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:24:36,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:24:36,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:36,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:24:36,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:36,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:24:36,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:24:36,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-08 14:24:36,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 14:24:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:36,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:24:36,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211604464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:24:36,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:24:36,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-02-08 14:24:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137500627] [2025-02-08 14:24:36,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:24:36,461 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:24:36,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:36,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 2 times [2025-02-08 14:24:36,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:36,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463091288] [2025-02-08 14:24:36,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:24:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:36,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:36,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:36,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:24:36,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:36,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:36,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:36,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:36,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:36,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:36,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:24:36,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 14:24:36,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 14:24:36,527 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 6 Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 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-02-08 14:24:36,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:24:36,600 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-02-08 14:24:36,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2025-02-08 14:24:36,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:24:36,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 23 transitions. [2025-02-08 14:24:36,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-02-08 14:24:36,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-02-08 14:24:36,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2025-02-08 14:24:36,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:24:36,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-02-08 14:24:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2025-02-08 14:24:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-02-08 14:24:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-02-08 14:24:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-02-08 14:24:36,603 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-02-08 14:24:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:24:36,606 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-02-08 14:24:36,606 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:24:36,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2025-02-08 14:24:36,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:24:36,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:36,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:36,607 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:24:36,607 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:24:36,607 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#1(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" [2025-02-08 14:24:36,607 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" [2025-02-08 14:24:36,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1952241097, now seen corresponding path program 1 times [2025-02-08 14:24:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:36,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846113471] [2025-02-08 14:24:36,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:36,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:24:36,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:24:36,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:36,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:36,635 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:36,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:24:36,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:24:36,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:36,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:36,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:36,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:36,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 3 times [2025-02-08 14:24:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:36,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308993710] [2025-02-08 14:24:36,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:24:36,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:36,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:36,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:36,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:24:36,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:36,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:36,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:36,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:36,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:36,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:36,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:36,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash 797014518, now seen corresponding path program 2 times [2025-02-08 14:24:36,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:36,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010357236] [2025-02-08 14:24:36,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:24:36,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:36,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-08 14:24:36,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:24:36,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:24:36,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:37,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:24:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010357236] [2025-02-08 14:24:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010357236] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:24:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813944834] [2025-02-08 14:24:37,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:24:37,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:24:37,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:37,090 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:24:37,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-08 14:24:37,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-08 14:24:37,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:24:37,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:24:37,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:37,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 14:24:37,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:37,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:24:37,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 14:24:37,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-02-08 14:24:37,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 14:24:37,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:24:37,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:24:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:37,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:24:37,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 14:24:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813944834] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:24:37,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:24:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2025-02-08 14:24:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672004549] [2025-02-08 14:24:37,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:24:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:24:37,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 14:24:37,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-02-08 14:24:37,507 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 6 Second operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 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-02-08 14:24:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:24:37,606 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-02-08 14:24:37,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 39 transitions. [2025-02-08 14:24:37,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:24:37,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 26 states and 29 transitions. [2025-02-08 14:24:37,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:24:37,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:24:37,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2025-02-08 14:24:37,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:24:37,607 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-02-08 14:24:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2025-02-08 14:24:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2025-02-08 14:24:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-02-08 14:24:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-02-08 14:24:37,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-02-08 14:24:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:24:37,609 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-02-08 14:24:37,609 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:24:37,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2025-02-08 14:24:37,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:24:37,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:37,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:37,610 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1] [2025-02-08 14:24:37,610 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:24:37,610 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#1(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" [2025-02-08 14:24:37,610 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" [2025-02-08 14:24:37,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash 830013528, now seen corresponding path program 3 times [2025-02-08 14:24:37,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:37,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758670478] [2025-02-08 14:24:37,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:24:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:37,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 4 equivalence classes. [2025-02-08 14:24:37,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:24:37,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 14:24:37,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:37,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:37,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:24:37,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:24:37,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:37,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:37,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:37,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 4 times [2025-02-08 14:24:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:37,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339235467] [2025-02-08 14:24:37,670 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:24:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:37,674 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-08 14:24:37,676 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:37,676 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:24:37,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:37,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:37,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:37,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:37,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:37,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:37,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:37,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:37,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1220916265, now seen corresponding path program 4 times [2025-02-08 14:24:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:37,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135670076] [2025-02-08 14:24:37,683 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:24:37,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:37,695 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-02-08 14:24:37,714 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:24:37,714 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:24:37,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:37,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:37,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:24:37,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:24:37,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:37,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:37,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:38,921 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:24:38,921 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:24:38,921 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:24:38,921 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:24:38,921 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:24:38,921 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:38,921 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:24:38,921 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:24:38,921 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration6_Lasso [2025-02-08 14:24:38,921 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:24:38,921 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:24:38,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:38,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:38,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:38,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:38,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:38,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:38,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:38,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:39,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:39,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:39,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:39,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:39,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:39,509 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:24:39,509 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:24:39,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,514 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:24:39,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:24:39,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:39,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:39,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:39,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:39,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-08 14:24:39,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,537 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-08 14:24:39,539 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-02-08 14:24:39,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:39,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:39,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:39,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:39,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-08 14:24:39,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,558 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-08 14:24:39,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:24:39,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:39,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:39,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:39,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-08 14:24:39,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,591 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-08 14:24:39,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:24:39,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:39,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:39,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:39,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:39,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-08 14:24:39,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,611 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-08 14:24:39,613 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-02-08 14:24:39,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:39,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:39,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:39,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:39,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-08 14:24:39,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,632 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:24:39,634 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-02-08 14:24:39,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:39,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:39,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:39,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:39,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-08 14:24:39,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,652 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-08 14:24:39,656 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-02-08 14:24:39,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:39,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:39,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:39,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-08 14:24:39,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,681 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-08 14:24:39,684 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-02-08 14:24:39,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:39,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:39,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:39,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-08 14:24:39,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,716 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-08 14:24:39,719 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-02-08 14:24:39,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:39,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:39,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:39,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:39,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,741 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-08 14:24:39,743 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-02-08 14:24:39,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:39,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:39,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:39,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-08 14:24:39,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,768 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-08 14:24:39,770 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-02-08 14:24:39,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:39,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:39,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:39,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:39,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:39,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:39,793 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:24:39,802 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-08 14:24:39,803 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-02-08 14:24:39,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:39,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:39,805 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:39,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-08 14:24:39,806 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:24:39,817 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-08 14:24:39,817 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:24:39,817 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~j_ref~0#1.base) 0)_2) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~j_ref~0#1.base) 0)_2 + 1 Supporting invariants [-1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3 + 1 >= 0] [2025-02-08 14:24:39,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:39,876 INFO L156 tatePredicateManager]: 20 out of 22 supporting invariants were superfluous and have been removed [2025-02-08 14:24:39,880 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 14:24:39,880 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 14:24:39,880 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] [2025-02-08 14:24:39,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:39,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:24:39,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:24:39,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:39,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:39,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 14:24:39,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:39,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:24:39,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 14:24:40,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 14:24:40,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:24:40,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-08 14:24:40,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:40,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:40,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:40,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:40,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:24:40,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:40,159 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-02-08 14:24:40,159 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6 Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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-02-08 14:24:40,190 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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 21 states and 24 transitions. Complement of second has 4 states. [2025-02-08 14:24:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:24:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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-02-08 14:24:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2025-02-08 14:24:40,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-08 14:24:40,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:40,192 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:24:40,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:40,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:24:40,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:24:40,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:40,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:40,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 14:24:40,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:40,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:24:40,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 14:24:40,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 14:24:40,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:24:40,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-08 14:24:40,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:40,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:40,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:40,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:40,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:24:40,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:40,471 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2025-02-08 14:24:40,471 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6 Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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-02-08 14:24:40,495 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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 21 states and 24 transitions. Complement of second has 4 states. [2025-02-08 14:24:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:24:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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-02-08 14:24:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2025-02-08 14:24:40,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-08 14:24:40,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:40,496 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:24:40,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:40,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:24:40,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:24:40,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:40,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:40,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 14:24:40,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:40,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:24:40,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 14:24:40,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 14:24:40,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:24:40,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-08 14:24:40,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:40,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:40,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:40,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:40,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:24:40,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:40,754 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-02-08 14:24:40,754 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6 Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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-02-08 14:24:41,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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 77 states and 87 transitions. Complement of second has 26 states. [2025-02-08 14:24:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 16 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-08 14:24:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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-02-08 14:24:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 39 transitions. [2025-02-08 14:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 39 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-08 14:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 39 transitions. Stem has 14 letters. Loop has 2 letters. [2025-02-08 14:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 39 transitions. Stem has 12 letters. Loop has 4 letters. [2025-02-08 14:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:41,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 87 transitions. [2025-02-08 14:24:41,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:24:41,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 32 states and 35 transitions. [2025-02-08 14:24:41,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-08 14:24:41,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-08 14:24:41,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 35 transitions. [2025-02-08 14:24:41,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:24:41,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-02-08 14:24:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 35 transitions. [2025-02-08 14:24:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2025-02-08 14:24:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-02-08 14:24:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-02-08 14:24:41,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-02-08 14:24:41,132 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-02-08 14:24:41,132 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:24:41,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2025-02-08 14:24:41,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:24:41,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:41,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:41,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1] [2025-02-08 14:24:41,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:24:41,133 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#1(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1;" "assume true;call test_fun_#t~mem5#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem5#1 >= 0;havoc test_fun_#t~mem5#1;call write~int#2(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);" [2025-02-08 14:24:41,133 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem7#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);" "assume test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;" [2025-02-08 14:24:41,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1187917255, now seen corresponding path program 5 times [2025-02-08 14:24:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:41,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177078123] [2025-02-08 14:24:41,136 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:24:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:41,148 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 5 equivalence classes. [2025-02-08 14:24:41,163 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:24:41,164 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-08 14:24:41,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:41,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:41,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:24:41,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:24:41,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:41,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:41,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:41,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 5 times [2025-02-08 14:24:41,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:41,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077755301] [2025-02-08 14:24:41,190 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:24:41,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:41,192 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:41,196 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:41,197 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:24:41,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:41,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:41,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:41,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:41,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:41,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:41,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:41,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash 872819064, now seen corresponding path program 6 times [2025-02-08 14:24:41,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:41,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603341970] [2025-02-08 14:24:41,202 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:24:41,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:41,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-08 14:24:41,210 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 5 equivalence classes. [2025-02-08 14:24:41,227 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:24:41,227 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-08 14:24:41,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:41,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:41,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:24:41,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:24:41,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:41,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:41,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:42,602 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:24:42,602 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:24:42,602 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:24:42,602 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:24:42,602 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:24:42,602 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:42,602 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:24:42,602 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:24:42,602 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration7_Lasso [2025-02-08 14:24:42,603 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:24:42,603 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:24:42,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:42,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:43,047 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:24:43,047 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:24:43,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:43,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:43,049 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:43,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-08 14:24:43,050 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-02-08 14:24:43,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:43,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:43,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:43,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:43,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:43,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:43,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:43,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:43,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-08 14:24:43,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:43,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:43,069 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:43,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-08 14:24:43,071 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-02-08 14:24:43,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:43,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:43,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:43,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:43,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:43,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:43,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:43,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:43,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:43,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:43,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:43,089 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:43,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-08 14:24:43,091 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-02-08 14:24:43,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:43,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:43,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:43,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:43,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:43,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:43,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:43,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-08 14:24:43,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:43,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:43,113 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:43,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-08 14:24:43,115 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-02-08 14:24:43,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:43,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:43,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:43,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:43,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:43,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:43,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:43,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-08 14:24:43,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:43,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:43,136 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:43,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-08 14:24:43,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-02-08 14:24:43,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:43,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:43,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:43,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:43,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:43,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:43,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:43,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-08 14:24:43,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:43,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:43,160 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:43,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-08 14:24:43,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:24:43,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:43,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:43,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:43,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:43,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:43,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:43,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:43,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-02-08 14:24:43,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:43,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:43,182 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:43,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-08 14:24:43,183 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-02-08 14:24:43,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:43,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:43,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:43,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:43,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:43,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:43,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:43,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-08 14:24:43,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:43,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:43,205 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:43,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-08 14:24:43,218 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-02-08 14:24:43,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:43,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:43,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:43,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:43,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:43,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:43,239 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:24:43,255 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-02-08 14:24:43,255 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-02-08 14:24:43,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:43,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:43,258 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:24:43,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-08 14:24:43,261 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:24:43,274 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:24:43,274 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:24:43,275 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_4, v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_4) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_4 - 1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_4 Supporting invariants [] [2025-02-08 14:24:43,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-08 14:24:43,314 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2025-02-08 14:24:43,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 14:24:43,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 14:24:43,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] [2025-02-08 14:24:43,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 14:24:43,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 14:24:43,316 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] [2025-02-08 14:24:43,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:43,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:24:43,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:24:43,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:43,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:43,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:24:43,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:43,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:43,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:43,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:43,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:43,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:24:43,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:43,391 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:24:43,391 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-08 14:24:43,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 42 transitions. Complement of second has 7 states. [2025-02-08 14:24:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:24:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-08 14:24:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:24:43,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 14 letters. Loop has 2 letters. [2025-02-08 14:24:43,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:43,417 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:24:43,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:43,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:24:43,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:24:43,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:43,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:43,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:24:43,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:43,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:43,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:43,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:43,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:43,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:24:43,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:43,493 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:24:43,493 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-08 14:24:43,514 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 42 transitions. Complement of second has 7 states. [2025-02-08 14:24:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:24:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-08 14:24:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:24:43,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 14 letters. Loop has 2 letters. [2025-02-08 14:24:43,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:43,515 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:24:43,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:43,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:24:43,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:24:43,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:43,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:43,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:24:43,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:43,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:43,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:43,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:43,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:43,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:24:43,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:24:43,592 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:24:43,592 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-08 14:24:43,611 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 45 transitions. Complement of second has 6 states. [2025-02-08 14:24:43,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:24:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-02-08 14:24:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-02-08 14:24:43,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 2 letters. [2025-02-08 14:24:43,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:43,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 16 letters. Loop has 2 letters. [2025-02-08 14:24:43,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:43,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2025-02-08 14:24:43,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:43,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2025-02-08 14:24:43,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:24:43,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2025-02-08 14:24:43,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:24:43,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:24:43,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:24:43,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:24:43,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:24:43,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:24:43,614 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:24:43,614 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:24:43,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:24:43,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:24:43,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:24:43,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:24:43 BoogieIcfgContainer [2025-02-08 14:24:43,622 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:24:43,622 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:24:43,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:24:43,623 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:24:43,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:24:31" (3/4) ... [2025-02-08 14:24:43,625 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:24:43,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:24:43,626 INFO L158 Benchmark]: Toolchain (without parser) took 12744.15ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.0MB in the beginning and 216.1MB in the end (delta: -110.0MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2025-02-08 14:24:43,626 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:24:43,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.94ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 90.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:24:43,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.84ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:24:43,627 INFO L158 Benchmark]: Boogie Preprocessor took 27.93ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 87.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:24:43,627 INFO L158 Benchmark]: IcfgBuilder took 311.15ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 74.1MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:24:43,628 INFO L158 Benchmark]: BuchiAutomizer took 12063.51ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 74.1MB in the beginning and 216.2MB in the end (delta: -142.0MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2025-02-08 14:24:43,628 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 302.0MB. Free memory was 216.2MB in the beginning and 216.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:24:43,629 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.94ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 90.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.84ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.93ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 87.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 311.15ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 74.1MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 12063.51ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 74.1MB in the beginning and 216.2MB in the end (delta: -142.0MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 302.0MB. Free memory was 216.2MB in the beginning and 216.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 20 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.0s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 9.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 42 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital201 mio100 ax108 hnf100 lsp91 ukn72 mio100 lsp25 div100 bol100 ite100 ukn100 eq166 hnf90 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:24:43,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-08 14:24:43,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-08 14:24:44,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:44,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE