./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc 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-recursive-malloc/rec_malloc_ex2.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 b91dcc12f43fdd03af0529f07bf7885945925554291ddde3b9ca40d8f32b93c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:08:45,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:08:45,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:08:45,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:08:45,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:08:45,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:08:45,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:08:45,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:08:45,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:08:45,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:08:45,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:08:45,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:08:45,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:08:45,408 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:08:45,408 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:08:45,408 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:08:45,408 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:08:45,408 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:08:45,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:08:45,409 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:08:45,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:08:45,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:08:45,410 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:08:45,410 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 -> b91dcc12f43fdd03af0529f07bf7885945925554291ddde3b9ca40d8f32b93c1 [2025-02-06 19:08:45,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:08:45,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:08:45,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:08:45,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:08:45,617 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:08:45,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2025-02-06 19:08:46,869 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cfa1d3c0/a21451f2cd6c4e9195b8d179c038f294/FLAGa68eccd40 [2025-02-06 19:08:47,088 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:08:47,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2025-02-06 19:08:47,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cfa1d3c0/a21451f2cd6c4e9195b8d179c038f294/FLAGa68eccd40 [2025-02-06 19:08:47,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cfa1d3c0/a21451f2cd6c4e9195b8d179c038f294 [2025-02-06 19:08:47,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:08:47,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:08:47,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:08:47,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:08:47,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:08:47,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbc6213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47, skipping insertion in model container [2025-02-06 19:08:47,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:08:47,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:08:47,654 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:08:47,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:08:47,674 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:08:47,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47 WrapperNode [2025-02-06 19:08:47,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:08:47,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:08:47,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:08:47,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:08:47,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,694 INFO L138 Inliner]: procedures = 11, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2025-02-06 19:08:47,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:08:47,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:08:47,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:08:47,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:08:47,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,713 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [5, 5]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-02-06 19:08:47,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:08:47,725 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:08:47,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:08:47,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:08:47,727 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,754 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-06 19:08:47,758 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-06 19:08:47,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:08:47,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:08:47,778 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2025-02-06 19:08:47,778 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2025-02-06 19:08:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 19:08:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:08:47,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:08:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:08:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:08:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:08:47,833 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:08:47,834 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:08:47,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: havoc #t~ret6; [2025-02-06 19:08:47,890 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc ~pv~0; [2025-02-06 19:08:47,940 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-06 19:08:47,941 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:08:47,949 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:08:47,950 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:08:47,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:47 BoogieIcfgContainer [2025-02-06 19:08:47,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:08:47,951 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:08:47,951 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:08:47,954 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:08:47,955 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:47,955 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:08:47" (1/3) ... [2025-02-06 19:08:47,955 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b359336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:08:47, skipping insertion in model container [2025-02-06 19:08:47,955 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:47,956 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (2/3) ... [2025-02-06 19:08:47,956 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b359336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:08:47, skipping insertion in model container [2025-02-06 19:08:47,956 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:47,956 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:47" (3/3) ... [2025-02-06 19:08:47,957 INFO L363 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2.i [2025-02-06 19:08:47,995 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:08:47,995 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:08:47,995 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:08:47,995 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:08:47,995 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:08:47,996 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:08:47,996 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:08:47,996 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:08:47,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:48,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:08:48,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:48,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:48,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:08:48,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:48,011 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:08:48,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:48,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:08:48,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:48,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:48,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:08:48,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:48,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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" [2025-02-06 19:08:48,016 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#24#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2025-02-06 19:08:48,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1568, now seen corresponding path program 1 times [2025-02-06 19:08:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346017229] [2025-02-06 19:08:48,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:48,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:48,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:48,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:48,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:48,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:48,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:48,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1400452965, now seen corresponding path program 1 times [2025-02-06 19:08:48,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079146296] [2025-02-06 19:08:48,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:48,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:08:48,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:08:48,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:48,479 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-06 19:08:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:48,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079146296] [2025-02-06 19:08:48,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079146296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:08:48,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:08:48,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:08:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463974747] [2025-02-06 19:08:48,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:08:48,482 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:08:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:48,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:08:48,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:08:48,521 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 19:08:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:48,592 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-02-06 19:08:48,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2025-02-06 19:08:48,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:08:48,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 17 transitions. [2025-02-06 19:08:48,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-06 19:08:48,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-06 19:08:48,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2025-02-06 19:08:48,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:48,611 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-06 19:08:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2025-02-06 19:08:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-06 19:08:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 19:08:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-02-06 19:08:48,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-06 19:08:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:08:48,645 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-06 19:08:48,649 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:08:48,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2025-02-06 19:08:48,650 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:08:48,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:48,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:48,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:08:48,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:48,651 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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" [2025-02-06 19:08:48,651 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#24#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2025-02-06 19:08:48,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1568, now seen corresponding path program 2 times [2025-02-06 19:08:48,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17568061] [2025-02-06 19:08:48,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:48,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:48,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:48,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:08:48,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:48,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:48,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:48,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:48,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash -784150995, now seen corresponding path program 1 times [2025-02-06 19:08:48,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549115382] [2025-02-06 19:08:48,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:48,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:08:48,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:08:48,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:08:49,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549115382] [2025-02-06 19:08:49,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549115382] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220451540] [2025-02-06 19:08:49,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:49,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:49,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:49,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:08:49,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 19:08:49,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:08:49,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:08:49,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:49,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:49,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 19:08:49,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:49,244 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 23 treesize of output 15 [2025-02-06 19:08:49,250 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-06 19:08:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:08:49,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:49,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220451540] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:49,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:49,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 21 [2025-02-06 19:08:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475922919] [2025-02-06 19:08:49,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:49,740 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:08:49,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:49,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 19:08:49,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-02-06 19:08:49,741 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 19:08:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:49,841 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-02-06 19:08:49,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2025-02-06 19:08:49,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:08:49,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2025-02-06 19:08:49,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-06 19:08:49,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-06 19:08:49,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2025-02-06 19:08:49,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:49,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-02-06 19:08:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2025-02-06 19:08:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-06 19:08:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 19:08:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-02-06 19:08:49,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-02-06 19:08:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 19:08:49,850 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-02-06 19:08:49,850 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:08:49,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2025-02-06 19:08:49,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:08:49,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:49,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:49,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:08:49,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:49,852 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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" [2025-02-06 19:08:49,852 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#24#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2025-02-06 19:08:49,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1568, now seen corresponding path program 3 times [2025-02-06 19:08:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:49,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698906012] [2025-02-06 19:08:49,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:49,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:49,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:49,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:08:49,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:49,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:49,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:49,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:49,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:49,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:49,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:49,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:49,867 INFO L85 PathProgramCache]: Analyzing trace with hash -984220893, now seen corresponding path program 2 times [2025-02-06 19:08:49,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:49,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984636954] [2025-02-06 19:08:49,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:49,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 19:08:49,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:49,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:49,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 19:08:50,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:50,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984636954] [2025-02-06 19:08:50,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984636954] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:50,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364756770] [2025-02-06 19:08:50,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:50,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:50,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:08:50,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 19:08:50,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 19:08:50,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:50,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:50,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:50,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 19:08:50,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:50,320 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 23 treesize of output 15 [2025-02-06 19:08:50,322 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-06 19:08:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:08:50,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364756770] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:51,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:51,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 14] total 26 [2025-02-06 19:08:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197694930] [2025-02-06 19:08:51,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:51,340 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:08:51,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:51,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 19:08:51,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2025-02-06 19:08:51,341 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand has 27 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 6 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 19:08:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:51,473 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-02-06 19:08:51,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2025-02-06 19:08:51,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:08:51,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2025-02-06 19:08:51,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-06 19:08:51,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 19:08:51,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2025-02-06 19:08:51,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:51,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-02-06 19:08:51,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2025-02-06 19:08:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-06 19:08:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 19:08:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-02-06 19:08:51,477 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-02-06 19:08:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:08:51,478 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-02-06 19:08:51,478 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:08:51,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2025-02-06 19:08:51,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:08:51,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:51,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:51,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:08:51,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:51,479 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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" [2025-02-06 19:08:51,479 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#24#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2025-02-06 19:08:51,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1568, now seen corresponding path program 4 times [2025-02-06 19:08:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814404864] [2025-02-06 19:08:51,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:08:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,483 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:08:51,489 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:51,489 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:08:51,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:51,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:51,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:51,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:51,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2054826001, now seen corresponding path program 3 times [2025-02-06 19:08:51,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416446849] [2025-02-06 19:08:51,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:51,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-02-06 19:08:51,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:08:51,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:08:51,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:51,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 19:08:51,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:08:51,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:51,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1502324176, now seen corresponding path program 1 times [2025-02-06 19:08:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343492939] [2025-02-06 19:08:51,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:08:51,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:08:51,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:51,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:08:51,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:08:51,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:54,166 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:54,166 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:54,166 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:54,166 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:54,167 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:54,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:54,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:54,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration4_Lasso [2025-02-06 19:08:54,167 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:54,167 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:54,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,082 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:55,084 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:55,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,109 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-06 19:08:55,111 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-06 19:08:55,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:55,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:55,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:55,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:08:55,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,159 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-06 19:08:55,163 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-06 19:08:55,163 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-06 19:08:55,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,173 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:08:55,173 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2025-02-06 19:08:55,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,403 INFO L401 nArgumentSynthesizer]: We have 608 Motzkin's Theorem applications. [2025-02-06 19:08:55,403 INFO L402 nArgumentSynthesizer]: A total of 32 supporting invariants were added. [2025-02-06 19:08:55,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,960 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-06 19:08:55,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,962 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-06 19:08:55,963 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-06 19:08:55,964 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-06 19:08:55,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,981 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-06 19:08:55,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,984 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-06 19:08:55,985 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-06 19:08:55,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-06 19:08:55,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,011 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-06 19:08:56,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,013 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-06 19:08:56,015 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-06 19:08:56,015 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-06 19:08:56,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:56,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,037 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-06 19:08:56,038 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-06 19:08:56,039 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-06 19:08:56,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:56,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,059 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-06 19:08:56,060 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-06 19:08:56,062 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-06 19:08:56,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,079 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:56,087 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-02-06 19:08:56,089 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:08:56,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,092 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-06 19:08:56,094 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-06 19:08:56,094 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:56,105 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:08:56,106 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:56,106 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~ip~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~ip~0#1.base) 0)_1 Supporting invariants [] [2025-02-06 19:08:56,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:56,123 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-02-06 19:08:56,131 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:08:56,131 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:08:56,131 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~ip~0!base,]]] [2025-02-06 19:08:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:56,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:56,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:56,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:56,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:08:56,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:56,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 19:08:56,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:08:56,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:56,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 19:08:56,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:56,356 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-06 19:08:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:08:56,505 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2025-02-06 19:08:56,506 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:56,638 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 70 states and 77 transitions. Complement of second has 24 states. [2025-02-06 19:08:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2025-02-06 19:08:56,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 15 transitions. Stem has 2 letters. Loop has 29 letters. [2025-02-06 19:08:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 15 transitions. Stem has 31 letters. Loop has 29 letters. [2025-02-06 19:08:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 15 transitions. Stem has 2 letters. Loop has 58 letters. [2025-02-06 19:08:56,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:56,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 77 transitions. [2025-02-06 19:08:56,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:08:56,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 39 states and 44 transitions. [2025-02-06 19:08:56,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-06 19:08:56,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-02-06 19:08:56,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2025-02-06 19:08:56,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:56,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-06 19:08:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2025-02-06 19:08:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2025-02-06 19:08:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 19:08:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-02-06 19:08:56,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-02-06 19:08:56,651 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-02-06 19:08:56,651 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:08:56,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2025-02-06 19:08:56,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:08:56,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:56,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:56,652 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:08:56,652 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:08:56,652 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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" "assume true;call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< [2025-02-06 19:08:56,652 INFO L754 eck$LassoCheckResult]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< [2025-02-06 19:08:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash 46728152, now seen corresponding path program 1 times [2025-02-06 19:08:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409023682] [2025-02-06 19:08:56,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:56,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:56,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:08:56,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:08:56,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:56,659 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:56,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:08:56,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:08:56,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:56,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:56,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1137938, now seen corresponding path program 1 times [2025-02-06 19:08:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:56,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679684841] [2025-02-06 19:08:56,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:56,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:56,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:56,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:56,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:56,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:56,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:56,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:56,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:56,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1401512599, now seen corresponding path program 1 times [2025-02-06 19:08:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:56,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330688361] [2025-02-06 19:08:56,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:56,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:08:56,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:08:56,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:56,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:56,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:08:56,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:08:56,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:56,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:57,073 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-06 19:08:57,253 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:57,253 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:57,253 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:57,253 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:57,253 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:57,253 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,253 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:57,253 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:57,253 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration5_Lasso [2025-02-06 19:08:57,253 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:57,253 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:57,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,778 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:57,778 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:57,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,781 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-06 19:08:57,783 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-06 19:08:57,783 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-06 19:08:57,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,801 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-06 19:08:57,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,803 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-06 19:08:57,804 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-06 19:08:57,805 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-06 19:08:57,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 19:08:57,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,823 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-06 19:08:57,824 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-06 19:08:57,825 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-06 19:08:57,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,843 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-06 19:08:57,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,845 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-06 19:08:57,860 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-06 19:08:57,860 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-06 19:08:57,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,876 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-06 19:08:57,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,878 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-06 19:08:57,879 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-06 19:08:57,880 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-06 19:08:57,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:57,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,900 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-06 19:08:57,900 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-06 19:08:57,902 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-06 19:08:57,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,926 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-06 19:08:57,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,928 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-06 19:08:57,929 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-06 19:08:57,931 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-06 19:08:57,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:08:57,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,948 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-06 19:08:57,949 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-06 19:08:57,951 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-06 19:08:57,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:57,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:57,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 19:08:57,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,983 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-06 19:08:57,986 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-06 19:08:57,986 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-06 19:08:57,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,996 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-02-06 19:08:57,996 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:08:57,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:58,003 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2025-02-06 19:08:58,003 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:08:58,015 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:58,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:58,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:58,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:58,023 INFO L229 MonitoredProcess]: Starting monitored process 21 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-06 19:08:58,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 19:08:58,029 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-06 19:08:58,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:58,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:58,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:58,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:58,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:58,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:58,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:58,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-06 19:08:58,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:58,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:58,056 INFO L229 MonitoredProcess]: Starting monitored process 22 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-06 19:08:58,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:08:58,058 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-06 19:08:58,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:58,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:58,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:58,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:58,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:58,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:58,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:58,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 19:08:58,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:58,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:58,078 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-06 19:08:58,079 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-06 19:08:58,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-06 19:08:58,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:58,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:58,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:58,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:58,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:58,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:58,101 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:58,112 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-06 19:08:58,112 INFO L444 ModelExtractionUtils]: 10 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-02-06 19:08:58,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:58,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:58,114 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-06 19:08:58,115 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-06 19:08:58,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:58,127 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:08:58,127 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:58,127 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int#1 rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2025-02-06 19:08:58,133 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-06 19:08:58,150 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-02-06 19:08:58,153 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-06 19:08:58,153 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-06 19:08:58,153 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2025-02-06 19:08:58,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:08:58,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:08:58,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:58,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:08:58,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:58,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:58,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:58,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:58,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 19:08:58,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:58,273 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 47 treesize of output 20 [2025-02-06 19:08:58,287 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-06 19:08:58,287 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-02-06 19:08:58,287 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 36 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:58,355 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 36 transitions. cyclomatic complexity: 7. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 77 transitions. Complement of second has 18 states. [2025-02-06 19:08:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-02-06 19:08:58,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-06 19:08:58,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:58,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-06 19:08:58,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:58,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 5 letters. Loop has 8 letters. [2025-02-06 19:08:58,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:58,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 77 transitions. [2025-02-06 19:08:58,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:08:58,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 45 states and 53 transitions. [2025-02-06 19:08:58,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:08:58,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:08:58,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 53 transitions. [2025-02-06 19:08:58,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:58,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-02-06 19:08:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 53 transitions. [2025-02-06 19:08:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 19:08:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-06 19:08:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-02-06 19:08:58,362 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-02-06 19:08:58,362 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-02-06 19:08:58,362 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:08:58,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 53 transitions. [2025-02-06 19:08:58,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:08:58,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:58,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:58,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:08:58,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:08:58,363 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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" "assume true;call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#24#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" "assume true;call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< [2025-02-06 19:08:58,363 INFO L754 eck$LassoCheckResult]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< [2025-02-06 19:08:58,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2114680264, now seen corresponding path program 2 times [2025-02-06 19:08:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:58,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220881759] [2025-02-06 19:08:58,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:58,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 19:08:58,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:08:58,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:58,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:58,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 19:08:59,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:59,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220881759] [2025-02-06 19:08:59,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220881759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:59,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494550475] [2025-02-06 19:08:59,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:59,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:59,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:59,074 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:08:59,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-06 19:08:59,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 19:08:59,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:08:59,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:59,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:59,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-06 19:08:59,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:59,167 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 11 [2025-02-06 19:08:59,186 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 11 treesize of output 7 [2025-02-06 19:08:59,505 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 40 treesize of output 17 [2025-02-06 19:08:59,507 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 30 treesize of output 18 [2025-02-06 19:08:59,528 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-06 19:08:59,531 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-06 19:08:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 19:08:59,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:00,338 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 29 treesize of output 21 [2025-02-06 19:09:00,565 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 29 treesize of output 21 [2025-02-06 19:09:00,683 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 31 treesize of output 23 [2025-02-06 19:09:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:09:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494550475] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:00,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 24] total 48 [2025-02-06 19:09:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738098121] [2025-02-06 19:09:00,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:00,924 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:00,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:00,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1137938, now seen corresponding path program 2 times [2025-02-06 19:09:00,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:00,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106075643] [2025-02-06 19:09:00,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:00,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:00,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:09:00,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:09:00,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:09:00,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:00,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:00,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:09:00,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:09:00,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:00,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:00,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:01,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:01,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 19:09:01,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1913, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 19:09:01,208 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. cyclomatic complexity: 12 Second operand has 48 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 32 states have internal predecessors, (52), 9 states have call successors, (9), 6 states have call predecessors, (9), 12 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-06 19:09:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:01,445 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2025-02-06 19:09:01,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. [2025-02-06 19:09:01,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:09:01,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 51 states and 63 transitions. [2025-02-06 19:09:01,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:09:01,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:09:01,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2025-02-06 19:09:01,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:01,448 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-02-06 19:09:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2025-02-06 19:09:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-02-06 19:09:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.088235294117647) internal successors, (37), 37 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-06 19:09:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-02-06 19:09:01,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-02-06 19:09:01,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 19:09:01,451 INFO L432 stractBuchiCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-02-06 19:09:01,451 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:09:01,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 57 transitions. [2025-02-06 19:09:01,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:09:01,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:01,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:01,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:09:01,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:09:01,452 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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" "assume true;call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#22#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#24#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" "assume true;call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< [2025-02-06 19:09:01,452 INFO L754 eck$LassoCheckResult]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< [2025-02-06 19:09:01,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash 718430072, now seen corresponding path program 3 times [2025-02-06 19:09:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:01,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186105897] [2025-02-06 19:09:01,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:01,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:01,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 6 equivalence classes. [2025-02-06 19:09:01,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 19:09:01,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 19:09:01,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,488 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:01,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 19:09:01,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 19:09:01,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:01,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:01,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:01,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1137938, now seen corresponding path program 3 times [2025-02-06 19:09:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:01,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715655667] [2025-02-06 19:09:01,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:01,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:09:01,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:09:01,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:09:01,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:01,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:09:01,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:09:01,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:01,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:01,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1289148151, now seen corresponding path program 4 times [2025-02-06 19:09:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356106981] [2025-02-06 19:09:01,528 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:01,537 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-02-06 19:09:01,565 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 19:09:01,565 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:01,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:01,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 19:09:01,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 19:09:01,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:01,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:06,394 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:09:06,394 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:09:06,394 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:09:06,394 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:09:06,394 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:09:06,394 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:06,394 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:09:06,394 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:09:06,394 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration7_Lasso [2025-02-06 19:09:06,394 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:09:06,394 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:09:06,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,889 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-02-06 19:09:12,435 WARN L286 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 168 DAG size of output: 168 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2025-02-06 19:09:12,488 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:09:12,488 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:09:12,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:12,491 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-06 19:09:12,493 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-06 19:09:12,493 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-06 19:09:12,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:12,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:12,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:12,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:12,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:12,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:12,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:12,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:12,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:12,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:12,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:12,528 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-06 19:09:12,528 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-06 19:09:12,530 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-06 19:09:12,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:12,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:12,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:12,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:12,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:12,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:12,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:12,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:12,551 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-06 19:09:12,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:12,553 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-06 19:09:12,554 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-06 19:09:12,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:12,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:12,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:12,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:12,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:12,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:12,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:12,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:12,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:12,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:12,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:12,582 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-06 19:09:12,583 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-06 19:09:12,583 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-06 19:09:12,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:12,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:12,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:12,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:12,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:12,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:12,597 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:12,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:12,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:12,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:12,608 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-06 19:09:12,609 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-06 19:09:12,610 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-06 19:09:12,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:12,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:12,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:12,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:12,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:12,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:12,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:12,630 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-06 19:09:12,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:12,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:12,633 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-06 19:09:12,634 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-06 19:09:12,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-06 19:09:12,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:12,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:12,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:12,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:12,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:12,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:12,648 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:12,654 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-06 19:09:12,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:12,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:12,657 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-06 19:09:12,657 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-06 19:09:12,659 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-06 19:09:12,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:12,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:12,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:12,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:12,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:12,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:12,680 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:09:12,693 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-06 19:09:12,693 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-02-06 19:09:12,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:12,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:12,695 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-06 19:09:12,697 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-06 19:09:12,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:09:12,708 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:09:12,708 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:09:12,708 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int#1 rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2025-02-06 19:09:12,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:12,725 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-02-06 19:09:12,726 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-06 19:09:12,726 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-06 19:09:12,726 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2025-02-06 19:09:12,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:12,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 19:09:12,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 19:09:12,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:12,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:12,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:09:12,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:13,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:09:13,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:09:13,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:13,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:13,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 19:09:13,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:13,140 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 47 treesize of output 20 [2025-02-06 19:09:13,154 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-06 19:09:13,155 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-02-06 19:09:13,155 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 57 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:09:13,217 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 57 transitions. cyclomatic complexity: 13. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 57 states and 66 transitions. Complement of second has 18 states. [2025-02-06 19:09:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-06 19:09:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:09:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-02-06 19:09:13,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 41 letters. Loop has 4 letters. [2025-02-06 19:09:13,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:13,219 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:09:13,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:13,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 19:09:13,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 19:09:13,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:13,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:13,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:09:13,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:13,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:09:13,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:09:13,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:13,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:13,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 19:09:13,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:13,524 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 47 treesize of output 20 [2025-02-06 19:09:13,535 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-06 19:09:13,535 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2025-02-06 19:09:13,536 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 57 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:09:13,613 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 57 transitions. cyclomatic complexity: 13. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 57 states and 66 transitions. Complement of second has 18 states. [2025-02-06 19:09:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-06 19:09:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:09:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-02-06 19:09:13,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 41 letters. Loop has 4 letters. [2025-02-06 19:09:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:13,617 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:09:13,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:13,671 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-06 19:09:13,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 19:09:13,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 19:09:13,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:13,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:13,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:09:13,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:13,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:09:13,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:09:13,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:13,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:13,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:09:13,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:13,918 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 47 treesize of output 20 [2025-02-06 19:09:13,929 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-06 19:09:13,929 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-02-06 19:09:13,930 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 57 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:09:14,006 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 57 transitions. cyclomatic complexity: 13. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 75 states and 84 transitions. Complement of second has 19 states. [2025-02-06 19:09:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-06 19:09:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:09:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2025-02-06 19:09:14,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 41 letters. Loop has 4 letters. [2025-02-06 19:09:14,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:14,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 45 letters. Loop has 4 letters. [2025-02-06 19:09:14,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:14,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 41 letters. Loop has 8 letters. [2025-02-06 19:09:14,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:14,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 84 transitions. [2025-02-06 19:09:14,009 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:09:14,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 0 states and 0 transitions. [2025-02-06 19:09:14,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:09:14,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:09:14,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:09:14,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:14,009 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:09:14,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:09:14,009 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:09:14,009 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:09:14,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:09:14,009 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:09:14,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:09:14,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:09:14 BoogieIcfgContainer [2025-02-06 19:09:14,014 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:09:14,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:09:14,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:09:14,015 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:09:14,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:47" (3/4) ... [2025-02-06 19:09:14,016 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:09:14,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:09:14,017 INFO L158 Benchmark]: Toolchain (without parser) took 26567.73ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 134.5MB in the beginning and 315.5MB in the end (delta: -181.0MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2025-02-06 19:09:14,017 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:09:14,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.36ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 124.1MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:09:14,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.88ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 123.2MB in the end (delta: 913.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:09:14,017 INFO L158 Benchmark]: Boogie Preprocessor took 27.80ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 121.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:09:14,018 INFO L158 Benchmark]: IcfgBuilder took 224.68ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.3MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:09:14,018 INFO L158 Benchmark]: BuchiAutomizer took 26063.34ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 109.3MB in the beginning and 315.6MB in the end (delta: -206.3MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-02-06 19:09:14,018 INFO L158 Benchmark]: Witness Printer took 2.18ms. Allocated memory is still 427.8MB. Free memory was 315.6MB in the beginning and 315.5MB in the end (delta: 129.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:09:14,019 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.19ms. Allocated memory is still 226.5MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.36ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 124.1MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.88ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 123.2MB in the end (delta: 913.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.80ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 121.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 224.68ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.3MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 26063.34ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 109.3MB in the beginning and 315.6MB in the end (delta: -206.3MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * Witness Printer took 2.18ms. Allocated memory is still 427.8MB. Free memory was 315.6MB in the beginning and 315.5MB in the end (delta: 129.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~ip~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[#in~p!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[#in~p!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 9 locations. One deterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 48 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.0s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 23.3s. Construction of modules took 0.4s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 33/33 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 405 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 676 IncrementalHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 79 mSDtfsCounter, 676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital272 mio100 ax100 hnf100 lsp98 ukn58 mio100 lsp37 div100 bol100 ite100 ukn100 eq163 hnf95 smp100 dnf2551 smp71 tf100 neg100 sie130 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 787ms VariablesStem: 2 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 16 SupportingInvariants: 32 MotzkinApplications: 608 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-06 19:09:14,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:14,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 19:09:14,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:14,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE