./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.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 a21396952d3c1812f4afc7acd202b7f8106d7865729c99629f4c895e2f73a4f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:27:41,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:27:41,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:27:41,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:27:41,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:27:41,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:27:41,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:27:41,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:27:41,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:27:41,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:27:41,822 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:27:41,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:27:41,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:27:41,822 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:27:41,822 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:27:41,826 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:27:41,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:27:41,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:27:41,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:27:41,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:27:41,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:27:41,828 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:27:41,828 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 -> a21396952d3c1812f4afc7acd202b7f8106d7865729c99629f4c895e2f73a4f9 [2025-02-08 14:27:42,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:27:42,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:27:42,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:27:42,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:27:42,082 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:27:42,083 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_ex11C.i [2025-02-08 14:27:43,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e02779648/8b4fe00bcb2c4162a49aff20a3dbe57e/FLAG8da8982a1 [2025-02-08 14:27:43,547 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:27:43,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i [2025-02-08 14:27:43,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e02779648/8b4fe00bcb2c4162a49aff20a3dbe57e/FLAG8da8982a1 [2025-02-08 14:27:43,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e02779648/8b4fe00bcb2c4162a49aff20a3dbe57e [2025-02-08 14:27:43,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:27:43,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:27:43,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:27:43,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:27:43,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:27:43,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f53cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43, skipping insertion in model container [2025-02-08 14:27:43,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:27:43,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:27:43,710 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:27:43,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:27:43,731 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:27:43,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43 WrapperNode [2025-02-08 14:27:43,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:27:43,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:27:43,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:27:43,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:27:43,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,754 INFO L138 Inliner]: procedures = 11, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2025-02-08 14:27:43,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:27:43,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:27:43,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:27:43,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:27:43,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,773 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [6, 4]. 60 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-08 14:27:43,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:27:43,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:27:43,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:27:43,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:27:43,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (1/1) ... [2025-02-08 14:27:43,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:43,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:43,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:43,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:27:43,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:27:43,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:27:43,835 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2025-02-08 14:27:43,835 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2025-02-08 14:27:43,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:27:43,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:27:43,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:27:43,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:27:43,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:27:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:27:43,891 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:27:43,892 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:27:43,976 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc ~r~0; [2025-02-08 14:27:44,022 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-08 14:27:44,022 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:27:44,032 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:27:44,032 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:27:44,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:27:44 BoogieIcfgContainer [2025-02-08 14:27:44,033 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:27:44,034 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:27:44,034 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:27:44,038 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:27:44,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:27:44,039 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:27:43" (1/3) ... [2025-02-08 14:27:44,040 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68f4f304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:27:44, skipping insertion in model container [2025-02-08 14:27:44,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:27:44,041 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:43" (2/3) ... [2025-02-08 14:27:44,041 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68f4f304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:27:44, skipping insertion in model container [2025-02-08 14:27:44,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:27:44,041 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:27:44" (3/3) ... [2025-02-08 14:27:44,042 INFO L363 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11C.i [2025-02-08 14:27:44,080 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:27:44,081 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:27:44,081 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:27:44,081 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:27:44,081 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:27:44,081 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:27:44,081 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:27:44,081 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:27:44,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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-08 14:27:44,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:27:44,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:44,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:44,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:27:44,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:44,103 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:27:44,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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-08 14:27:44,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:27:44,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:44,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:44,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:27:44,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:44,109 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~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1;" [2025-02-08 14:27:44,110 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem8#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "assume main_#t~mem8#1 > 1;havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4);" "assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int#0(~op.base, ~op.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0;" "assume true;" >"#27#return;" "call write~int#1(main_#t~mem13#1 + (if -1 == main_#t~ret12#1 then -1 else 1), main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_~pp~0#1.base, main_~pp~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2025-02-08 14:27:44,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2025-02-08 14:27:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88721204] [2025-02-08 14:27:44,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:44,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:44,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:44,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:44,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:44,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:44,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:44,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2054527284, now seen corresponding path program 1 times [2025-02-08 14:27:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:44,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092470349] [2025-02-08 14:27:44,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:44,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:27:44,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:27:44,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:44,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092470349] [2025-02-08 14:27:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092470349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:27:44,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:27:44,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 14:27:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476600915] [2025-02-08 14:27:44,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:27:44,596 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:27:44,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:44,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 14:27:44,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 14:27:44,617 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-08 14:27:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:44,700 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-02-08 14:27:44,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2025-02-08 14:27:44,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:27:44,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 17 transitions. [2025-02-08 14:27:44,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-08 14:27:44,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-08 14:27:44,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2025-02-08 14:27:44,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:27:44,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-08 14:27:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2025-02-08 14:27:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-08 14:27:44,730 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-08 14:27:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-02-08 14:27:44,731 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-08 14:27:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:27:44,734 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-08 14:27:44,734 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:27:44,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2025-02-08 14:27:44,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:27:44,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:44,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:44,735 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:27:44,735 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:44,735 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~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1;" [2025-02-08 14:27:44,736 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem8#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "assume main_#t~mem8#1 > 1;havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#0(main_~pp~0#1.base, main_~pp~0#1.offset, 4);" "assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#1(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int#0(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#0(~op.base, ~op.offset, 4);call write~int#0(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int#0(~op.base, ~op.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0;" "assume true;" >"#25#return;" "~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0;" "assume true;" >"#27#return;" "call write~int#1(main_#t~mem13#1 + (if -1 == main_#t~ret12#1 then -1 else 1), main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_~pp~0#1.base, main_~pp~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2025-02-08 14:27:44,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2025-02-08 14:27:44,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:44,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-02-08 14:27:44,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:44,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:44,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:44,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:27:44,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,745 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:44,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:44,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:44,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:44,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1182173125, now seen corresponding path program 1 times [2025-02-08 14:27:44,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:44,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204155539] [2025-02-08 14:27:44,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:44,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:44,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:27:44,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:27:44,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:44,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:27:44,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:27:44,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:44,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:44,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1460166663, now seen corresponding path program 1 times [2025-02-08 14:27:44,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:44,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633897905] [2025-02-08 14:27:44,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:44,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:44,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:27:44,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:27:44,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:44,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:27:44,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:27:44,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:45,951 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:45,952 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:45,952 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:45,952 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:45,952 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:45,952 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,952 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:45,952 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:45,953 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C.i_Iteration2_Lasso [2025-02-08 14:27:45,953 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:45,953 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:45,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:45,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:45,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:45,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:46,340 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:46,343 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:46,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:46,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:46,346 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:46,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:27:46,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:46,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:46,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:46,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:46,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:46,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:46,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:46,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:46,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:46,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:46,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:46,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:46,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:46,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:27:46,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:46,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:46,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:46,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:46,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:46,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:46,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:46,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:46,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:46,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-08 14:27:46,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:46,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:46,410 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:46,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:27:46,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:46,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:46,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:46,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:46,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:46,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:46,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:46,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:46,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:46,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:46,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:46,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:46,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:46,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:27:46,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:46,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:46,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:46,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:46,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:46,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:46,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:46,461 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:46,490 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-08 14:27:46,491 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-08 14:27:46,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:46,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:46,496 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:46,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:27:46,499 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:46,510 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:27:46,511 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:46,511 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~qq~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~qq~0#1.base) 0)_1 Supporting invariants [] [2025-02-08 14:27:46,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-08 14:27:46,529 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-02-08 14:27:46,534 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-08 14:27:46,535 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-08 14:27:46,535 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~qq~0!base,]]] [2025-02-08 14:27:46,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:46,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:46,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:46,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:46,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:27:46,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:46,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:27:46,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:27:46,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:46,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 14:27:46,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:46,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:27:58,842 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-08 14:28:10,992 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-08 14:28:23,088 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-08 14:28:23,162 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-08 14:28:23,164 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2025-02-08 14:28:23,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 14:28:23,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:47,477 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-08 14:28:59,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 14:29:23,808 WARN L286 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)