./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:01:09,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:01:09,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:01:09,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:01:09,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:01:09,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:01:09,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:01:09,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:01:09,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:01:09,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:01:09,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:01:09,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:01:09,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:01:09,521 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:01:09,521 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:01:09,521 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:01:09,521 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:01:09,521 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:01:09,521 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:01:09,521 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:01:09,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:01:09,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:01:09,523 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:01:09,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:01:09,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:01:09,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:01:09,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:01:09,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:01:09,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:01:09,524 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:01:09,524 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 [2025-03-04 16:01:09,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:01:09,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:01:09,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:01:09,753 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:01:09,753 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:01:09,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2025-03-04 16:01:10,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8800acd/5a782370112c48478f534605b077e001/FLAG1dd1c44e1 [2025-03-04 16:01:11,165 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:01:11,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2025-03-04 16:01:11,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8800acd/5a782370112c48478f534605b077e001/FLAG1dd1c44e1 [2025-03-04 16:01:11,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8800acd/5a782370112c48478f534605b077e001 [2025-03-04 16:01:11,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:01:11,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:01:11,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:01:11,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:01:11,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:01:11,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d6ffa3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11, skipping insertion in model container [2025-03-04 16:01:11,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:01:11,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:01:11,740 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:01:11,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:01:11,795 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:01:11,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11 WrapperNode [2025-03-04 16:01:11,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:01:11,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:01:11,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:01:11,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:01:11,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,825 INFO L138 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 28, calls inlined = 5, statements flattened = 63 [2025-03-04 16:01:11,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:01:11,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:01:11,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:01:11,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:01:11,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,851 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 16:01:11,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:01:11,863 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:01:11,863 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:01:11,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:01:11,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (1/1) ... [2025-03-04 16:01:11,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:11,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 16:01:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 16:01:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:01:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 16:01:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 16:01:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 16:01:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 16:01:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 16:01:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 16:01:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 16:01:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:01:11,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:01:11,986 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:01:11,988 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:01:12,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; [2025-03-04 16:01:12,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-2: havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; [2025-03-04 16:01:12,083 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-04 16:01:12,084 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:01:12,089 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:01:12,089 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:01:12,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:01:12 BoogieIcfgContainer [2025-03-04 16:01:12,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:01:12,090 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:01:12,090 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:01:12,093 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:01:12,094 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:01:12,094 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:01:11" (1/3) ... [2025-03-04 16:01:12,095 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39690cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:01:12, skipping insertion in model container [2025-03-04 16:01:12,095 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:01:12,095 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:11" (2/3) ... [2025-03-04 16:01:12,095 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39690cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:01:12, skipping insertion in model container [2025-03-04 16:01:12,095 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:01:12,095 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:01:12" (3/3) ... [2025-03-04 16:01:12,099 INFO L363 chiAutomizerObserver]: Analyzing ICFG memleaks_test18.i [2025-03-04 16:01:12,129 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:01:12,129 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:01:12,130 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:01:12,130 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:01:12,130 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:01:12,130 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:01:12,130 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:01:12,130 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:01:12,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:12,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-04 16:01:12,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:12,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:12,145 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:01:12,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:01:12,146 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:01:12,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:12,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-04 16:01:12,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:12,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:12,147 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:01:12,147 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:01:12,151 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0;" "entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1;" [2025-03-04 16:01:12,151 INFO L754 eck$LassoCheckResult]: Loop: "assume entry_point_~i~0#1 < entry_point_~len~0#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0;" "entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;" "assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$#1(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4);entry_point_#t~post44#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post44#1;havoc entry_point_#t~post44#1;" [2025-03-04 16:01:12,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash 55317752, now seen corresponding path program 1 times [2025-03-04 16:01:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964968401] [2025-03-04 16:01:12,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:12,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:01:12,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:01:12,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:12,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:01:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964968401] [2025-03-04 16:01:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964968401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:01:12,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:01:12,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:01:12,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987319912] [2025-03-04 16:01:12,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:01:12,345 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:01:12,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1445695, now seen corresponding path program 1 times [2025-03-04 16:01:12,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249816138] [2025-03-04 16:01:12,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:12,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:12,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:12,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:12,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:01:12,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249816138] [2025-03-04 16:01:12,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249816138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:01:12,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:01:12,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:01:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127858881] [2025-03-04 16:01:12,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:01:12,468 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:01:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:01:12,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:01:12,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:01:12,491 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:01:12,517 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-04 16:01:12,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2025-03-04 16:01:12,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-04 16:01:12,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 18 transitions. [2025-03-04 16:01:12,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 16:01:12,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 16:01:12,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2025-03-04 16:01:12,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:01:12,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-04 16:01:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2025-03-04 16:01:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-04 16:01:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-03-04 16:01:12,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-04 16:01:12,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:01:12,546 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-04 16:01:12,546 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:01:12,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-03-04 16:01:12,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-04 16:01:12,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:12,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:12,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:01:12,546 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:01:12,547 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0;" "entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1;" [2025-03-04 16:01:12,547 INFO L754 eck$LassoCheckResult]: Loop: "assume entry_point_~i~0#1 < entry_point_~len~0#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;" "assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$#1(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4);entry_point_#t~post44#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post44#1;havoc entry_point_#t~post44#1;" [2025-03-04 16:01:12,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,547 INFO L85 PathProgramCache]: Analyzing trace with hash 55317752, now seen corresponding path program 2 times [2025-03-04 16:01:12,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287429246] [2025-03-04 16:01:12,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:01:12,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:01:12,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:01:12,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:01:12,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:01:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287429246] [2025-03-04 16:01:12,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287429246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:01:12,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:01:12,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:01:12,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319105709] [2025-03-04 16:01:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:01:12,626 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:01:12,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1443773, now seen corresponding path program 1 times [2025-03-04 16:01:12,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175678212] [2025-03-04 16:01:12,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:12,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:12,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:12,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:12,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:12,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:12,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:01:12,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:01:12,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:01:12,883 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:01:12,897 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2025-03-04 16:01:12,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2025-03-04 16:01:12,898 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-04 16:01:12,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 16 transitions. [2025-03-04 16:01:12,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 16:01:12,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 16:01:12,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2025-03-04 16:01:12,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:01:12,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-04 16:01:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2025-03-04 16:01:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-04 16:01:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-03-04 16:01:12,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-04 16:01:12,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:01:12,900 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-04 16:01:12,901 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:01:12,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2025-03-04 16:01:12,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-04 16:01:12,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:12,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:12,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:01:12,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:01:12,901 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1;" [2025-03-04 16:01:12,902 INFO L754 eck$LassoCheckResult]: Loop: "assume entry_point_~i~0#1 < entry_point_~len~0#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;" "assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$#1(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4);entry_point_#t~post44#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post44#1;havoc entry_point_#t~post44#1;" [2025-03-04 16:01:12,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash 55315830, now seen corresponding path program 1 times [2025-03-04 16:01:12,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048410353] [2025-03-04 16:01:12,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:01:12,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:01:12,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:12,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:01:12,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:01:12,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:12,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1443773, now seen corresponding path program 2 times [2025-03-04 16:01:12,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717226987] [2025-03-04 16:01:12,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:01:12,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:12,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:12,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:01:12,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:12,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:12,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:12,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:12,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash 990139058, now seen corresponding path program 1 times [2025-03-04 16:01:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521683409] [2025-03-04 16:01:12,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:01:12,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:01:12,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:12,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:01:12,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:01:12,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:13,359 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:01:13,360 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:01:13,360 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:01:13,360 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:01:13,360 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:01:13,360 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:13,360 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:01:13,360 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:01:13,360 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration3_Lasso [2025-03-04 16:01:13,360 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:01:13,360 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:01:13,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:13,803 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:01:13,806 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:01:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:13,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:13,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 16:01:13,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:13,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:13,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:13,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:13,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:13,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:13,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:13,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:13,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 16:01:13,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:13,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:13,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:13,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 16:01:13,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:13,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:13,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:13,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:13,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:13,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:13,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:13,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:13,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 16:01:13,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:13,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:13,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:13,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 16:01:13,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:13,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:13,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:13,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:13,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:13,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:13,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:13,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:13,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:13,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 16:01:13,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:13,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:13,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:13,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 16:01:13,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:13,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:13,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:13,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:13,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:13,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:13,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:13,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:13,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:13,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 16:01:13,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:13,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:13,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:13,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 16:01:13,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:13,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:13,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:13,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:13,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:13,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:13,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:13,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:13,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:13,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 16:01:13,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:13,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:13,933 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:13,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 16:01:13,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:13,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:13,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:13,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:13,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:13,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:13,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:13,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:13,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:13,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:13,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:13,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:13,953 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:13,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 16:01:13,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:13,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:13,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:13,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:13,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:13,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:13,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:13,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:13,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:13,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:13,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:13,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:13,974 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:13,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 16:01:13,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:13,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:13,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:13,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:13,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:13,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:13,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:13,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 16:01:14,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,002 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 16:01:14,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:14,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:14,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:14,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,028 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 16:01:14,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 16:01:14,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,050 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 16:01:14,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:14,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:14,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 16:01:14,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,081 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 16:01:14,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:14,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:14,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:14,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,107 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 16:01:14,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 16:01:14,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,127 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 16:01:14,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 16:01:14,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,147 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 16:01:14,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,167 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 16:01:14,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 16:01:14,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,187 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 16:01:14,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:14,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,209 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 16:01:14,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:14,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,232 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 16:01:14,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:14,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:14,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:14,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,256 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:01:14,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:14,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,278 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 16:01:14,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 16:01:14,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,302 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 16:01:14,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:14,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,324 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 16:01:14,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:14,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,343 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 16:01:14,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:14,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,364 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 16:01:14,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:14,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:14,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 16:01:14,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,387 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 16:01:14,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:14,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:14,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:14,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:14,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 16:01:14,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,409 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 16:01:14,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:14,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:14,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:14,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:14,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:14,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:14,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:14,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:01:14,444 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-04 16:01:14,446 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 16:01:14,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:14,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,449 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 16:01:14,452 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:01:14,464 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:01:14,464 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:01:14,465 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~0#1, ULTIMATE.start_entry_point_~len~0#1) = -1*ULTIMATE.start_entry_point_~i~0#1 + 1*ULTIMATE.start_entry_point_~len~0#1 Supporting invariants [] [2025-03-04 16:01:14,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-04 16:01:14,480 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-04 16:01:14,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:14,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:01:14,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:01:14,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:14,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:01:14,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:01:14,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:14,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:14,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:14,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:01:14,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:01:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:14,564 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:01:14,564 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:14,598 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 27 transitions. Complement of second has 5 states. [2025-03-04 16:01:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:01:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-04 16:01:14,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-04 16:01:14,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:01:14,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-04 16:01:14,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:01:14,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 8 letters. [2025-03-04 16:01:14,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:01:14,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2025-03-04 16:01:14,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:01:14,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 23 transitions. [2025-03-04 16:01:14,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 16:01:14,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 16:01:14,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2025-03-04 16:01:14,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:01:14,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-04 16:01:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2025-03-04 16:01:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2025-03-04 16:01:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-04 16:01:14,606 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-04 16:01:14,606 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-04 16:01:14,606 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:01:14,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2025-03-04 16:01:14,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:01:14,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:14,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:14,606 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:01:14,606 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:01:14,606 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1;" "assume !(entry_point_~i~0#1 < entry_point_~len~0#1);" "entry_point_~j~0#1 := entry_point_~i~0#1 - 1;" [2025-03-04 16:01:14,606 INFO L754 eck$LassoCheckResult]: Loop: "assume entry_point_~j~0#1 >= 0;call entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset := read~$Pointer$#1(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset);havoc entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset;entry_point_#t~post46#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post46#1 - 1;havoc entry_point_#t~post46#1;" [2025-03-04 16:01:14,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1618905641, now seen corresponding path program 1 times [2025-03-04 16:01:14,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:14,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239229224] [2025-03-04 16:01:14,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:14,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:14,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:01:14,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:01:14,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:01:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239229224] [2025-03-04 16:01:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239229224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:01:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:01:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:01:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015707872] [2025-03-04 16:01:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:01:14,643 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:01:14,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:14,644 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 1 times [2025-03-04 16:01:14,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:14,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379098152] [2025-03-04 16:01:14,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:14,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:14,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:14,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:14,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:14,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:14,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:14,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:14,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:14,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:01:14,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:01:14,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:01:14,683 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:01:14,695 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-04 16:01:14,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2025-03-04 16:01:14,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:01:14,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 29 transitions. [2025-03-04 16:01:14,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-04 16:01:14,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-04 16:01:14,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2025-03-04 16:01:14,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:01:14,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-04 16:01:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2025-03-04 16:01:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2025-03-04 16:01:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-04 16:01:14,697 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-04 16:01:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:01:14,698 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-04 16:01:14,698 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:01:14,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-03-04 16:01:14,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:01:14,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:14,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:14,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:01:14,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:01:14,699 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1;" "assume entry_point_~i~0#1 < entry_point_~len~0#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;" "assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0;" "entry_point_~j~0#1 := entry_point_~i~0#1 - 1;" [2025-03-04 16:01:14,699 INFO L754 eck$LassoCheckResult]: Loop: "assume entry_point_~j~0#1 >= 0;call entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset := read~$Pointer$#1(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset);havoc entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset;entry_point_#t~post46#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post46#1 - 1;havoc entry_point_#t~post46#1;" [2025-03-04 16:01:14,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 629539669, now seen corresponding path program 1 times [2025-03-04 16:01:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274759301] [2025-03-04 16:01:14,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:14,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:01:14,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:01:14,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:14,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:01:14,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274759301] [2025-03-04 16:01:14,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274759301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:01:14,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:01:14,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:01:14,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576043576] [2025-03-04 16:01:14,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:01:14,732 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:01:14,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 2 times [2025-03-04 16:01:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:14,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459368464] [2025-03-04 16:01:14,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:01:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:14,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:14,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:14,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:01:14,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:14,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:14,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:14,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:14,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:14,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:14,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:01:14,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:01:14,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:01:14,772 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:01:14,785 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2025-03-04 16:01:14,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2025-03-04 16:01:14,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:01:14,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 18 transitions. [2025-03-04 16:01:14,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 16:01:14,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 16:01:14,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2025-03-04 16:01:14,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:01:14,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-04 16:01:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2025-03-04 16:01:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 16:01:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-03-04 16:01:14,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-04 16:01:14,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:01:14,788 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-04 16:01:14,788 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:01:14,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2025-03-04 16:01:14,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:01:14,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:14,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:14,789 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:01:14,789 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:01:14,789 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1;" "assume entry_point_~i~0#1 < entry_point_~len~0#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0;" "entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;" "assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0;" "entry_point_~j~0#1 := entry_point_~i~0#1 - 1;" [2025-03-04 16:01:14,789 INFO L754 eck$LassoCheckResult]: Loop: "assume entry_point_~j~0#1 >= 0;call entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset := read~$Pointer$#1(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset);havoc entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset;entry_point_#t~post46#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post46#1 - 1;havoc entry_point_#t~post46#1;" [2025-03-04 16:01:14,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 629599251, now seen corresponding path program 1 times [2025-03-04 16:01:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:14,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29380279] [2025-03-04 16:01:14,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:14,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:01:14,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:01:14,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:14,797 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:14,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:01:14,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:01:14,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:14,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:14,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:14,804 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 3 times [2025-03-04 16:01:14,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:14,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957378470] [2025-03-04 16:01:14,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:01:14,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:14,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:14,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:14,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:01:14,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:14,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:14,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:14,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:14,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:14,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:14,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1957259695, now seen corresponding path program 1 times [2025-03-04 16:01:14,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:14,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308198319] [2025-03-04 16:01:14,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:14,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:14,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:01:14,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:01:14,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:14,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:01:14,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308198319] [2025-03-04 16:01:14,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308198319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:01:14,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:01:14,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:01:14,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045628246] [2025-03-04 16:01:14,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:01:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:01:14,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:01:14,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:01:14,891 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:01:14,912 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-03-04 16:01:14,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2025-03-04 16:01:14,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:01:14,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 20 transitions. [2025-03-04 16:01:14,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 16:01:14,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 16:01:14,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2025-03-04 16:01:14,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:01:14,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-04 16:01:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2025-03-04 16:01:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2025-03-04 16:01:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-03-04 16:01:14,914 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-04 16:01:14,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:01:14,916 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-04 16:01:14,916 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:01:14,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2025-03-04 16:01:14,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:01:14,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:14,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:14,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:01:14,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:01:14,917 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1;" "assume entry_point_~i~0#1 < entry_point_~len~0#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;" "assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$#1(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4);entry_point_#t~post44#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post44#1;havoc entry_point_#t~post44#1;" "assume !(entry_point_~i~0#1 < entry_point_~len~0#1);" "entry_point_~j~0#1 := entry_point_~i~0#1 - 1;" [2025-03-04 16:01:14,917 INFO L754 eck$LassoCheckResult]: Loop: "assume entry_point_~j~0#1 >= 0;call entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset := read~$Pointer$#1(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset);havoc entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset;entry_point_#t~post46#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post46#1 - 1;havoc entry_point_#t~post46#1;" [2025-03-04 16:01:14,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1959104411, now seen corresponding path program 1 times [2025-03-04 16:01:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:14,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534001994] [2025-03-04 16:01:14,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:14,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:01:14,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:01:14,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:14,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:01:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534001994] [2025-03-04 16:01:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534001994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:01:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084588314] [2025-03-04 16:01:14,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:14,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:01:14,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:14,979 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:01:14,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 16:01:15,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:01:15,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:01:15,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:15,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:15,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:01:15,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:01:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:15,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:01:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:15,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084588314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:01:15,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:01:15,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 16:01:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610563259] [2025-03-04 16:01:15,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:01:15,090 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:01:15,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 4 times [2025-03-04 16:01:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691673595] [2025-03-04 16:01:15,090 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:01:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:15,093 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-04 16:01:15,094 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:15,094 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:01:15,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:15,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:15,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:15,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:15,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:15,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:15,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:15,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:01:15,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 16:01:15,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-04 16:01:15,128 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:01:15,172 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-04 16:01:15,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2025-03-04 16:01:15,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:01:15,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 42 transitions. [2025-03-04 16:01:15,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-04 16:01:15,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-04 16:01:15,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2025-03-04 16:01:15,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:01:15,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-04 16:01:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2025-03-04 16:01:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2025-03-04 16:01:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-03-04 16:01:15,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-04 16:01:15,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:01:15,179 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-04 16:01:15,179 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:01:15,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2025-03-04 16:01:15,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 16:01:15,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:15,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:15,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:01:15,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:01:15,180 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~post44#1, entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset, entry_point_#t~post46#1, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1;" "assume entry_point_~i~0#1 < entry_point_~len~0#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;" "assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$#1(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4);entry_point_#t~post44#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post44#1;havoc entry_point_#t~post44#1;" "assume entry_point_~i~0#1 < entry_point_~len~0#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0;" "entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;" "assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0;" "entry_point_~j~0#1 := entry_point_~i~0#1 - 1;" [2025-03-04 16:01:15,180 INFO L754 eck$LassoCheckResult]: Loop: "assume entry_point_~j~0#1 >= 0;call entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset := read~$Pointer$#1(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset);havoc entry_point_#t~mem45#1.base, entry_point_#t~mem45#1.offset;entry_point_#t~post46#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post46#1 - 1;havoc entry_point_#t~post46#1;" [2025-03-04 16:01:15,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash 630492247, now seen corresponding path program 1 times [2025-03-04 16:01:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321280276] [2025-03-04 16:01:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:15,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:15,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:01:15,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:01:15,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:15,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:15,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:15,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:01:15,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:01:15,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:15,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:15,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 5 times [2025-03-04 16:01:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:15,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462137099] [2025-03-04 16:01:15,213 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:01:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:15,217 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:15,217 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:15,218 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:01:15,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:15,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:15,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:15,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:15,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:15,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:15,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:15,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1929576819, now seen corresponding path program 1 times [2025-03-04 16:01:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:15,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958756650] [2025-03-04 16:01:15,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:15,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:15,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:01:15,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:01:15,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:15,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:15,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:15,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:01:15,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:01:15,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:15,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:15,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:15,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:15,806 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:01:15,807 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:01:15,807 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:01:15,807 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:01:15,807 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:01:15,807 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:15,807 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:01:15,807 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:01:15,807 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration8_Lasso [2025-03-04 16:01:15,807 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:01:15,807 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:01:15,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:15,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:16,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:16,263 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:01:16,263 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:01:16,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,267 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 16:01:16,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:16,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:16,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:16,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:16,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,286 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 16:01:16,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:16,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:16,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:16,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:16,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,305 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 16:01:16,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:16,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:16,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 16:01:16,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,328 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 16:01:16,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:16,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:16,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:16,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,351 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 16:01:16,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:16,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:16,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 16:01:16,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,374 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 16:01:16,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:16,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:16,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:16,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,400 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 16:01:16,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:16,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:16,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:16,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:16,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,422 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 16:01:16,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:16,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:16,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:16,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:16,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,442 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 16:01:16,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:16,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:16,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-04 16:01:16,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,464 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 16:01:16,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:16,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:16,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:16,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 16:01:16,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,483 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 16:01:16,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:16,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:16,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:16,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 16:01:16,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,505 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 16:01:16,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:16,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:16,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:16,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:16,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:16,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:16,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:16,524 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:01:16,539 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-04 16:01:16,539 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 16:01:16,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:16,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:16,541 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:01:16,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 16:01:16,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:01:16,553 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:01:16,553 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:01:16,553 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0#1, v_rep(select #length ULTIMATE.start_entry_point_~array~0#1.base)_2) = 8*ULTIMATE.start_entry_point_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0#1.base)_2 Supporting invariants [] [2025-03-04 16:01:16,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:16,568 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 16:01:16,570 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 16:01:16,570 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 16:01:16,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:16,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:01:16,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:01:16,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:16,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:16,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:01:16,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:01:16,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:16,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:16,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:16,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:16,619 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:01:16,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:01:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:16,620 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 16:01:16,620 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:16,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 7. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 33 transitions. Complement of second has 2 states. [2025-03-04 16:01:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 16:01:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2025-03-04 16:01:16,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 14 letters. Loop has 1 letters. [2025-03-04 16:01:16,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:01:16,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 15 letters. Loop has 1 letters. [2025-03-04 16:01:16,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:01:16,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-04 16:01:16,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:01:16,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2025-03-04 16:01:16,629 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:01:16,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2025-03-04 16:01:16,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:01:16,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:01:16,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:01:16,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:01:16,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:01:16,630 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:01:16,630 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:01:16,630 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:01:16,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:01:16,630 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:01:16,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:01:16,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:01:16 BoogieIcfgContainer [2025-03-04 16:01:16,637 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:01:16,638 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:01:16,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:01:16,638 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:01:16,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:01:12" (3/4) ... [2025-03-04 16:01:16,640 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:01:16,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:01:16,641 INFO L158 Benchmark]: Toolchain (without parser) took 5201.14ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 110.5MB in the beginning and 250.7MB in the end (delta: -140.1MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2025-03-04 16:01:16,642 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:01:16,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.59ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 89.0MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 16:01:16,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.09ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 87.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:01:16,643 INFO L158 Benchmark]: Boogie Preprocessor took 33.16ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:01:16,644 INFO L158 Benchmark]: IcfgBuilder took 226.23ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 71.7MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:01:16,644 INFO L158 Benchmark]: BuchiAutomizer took 4547.56ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 71.7MB in the beginning and 250.8MB in the end (delta: -179.0MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2025-03-04 16:01:16,644 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 385.9MB. Free memory was 250.8MB in the beginning and 250.7MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:01:16,645 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.59ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 89.0MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.09ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 87.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.16ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 226.23ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 71.7MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4547.56ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 71.7MB in the beginning and 250.8MB in the end (delta: -179.0MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 385.9MB. Free memory was 250.8MB in the beginning and 250.7MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (6 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -1 * i) + len) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 2 locations. 6 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 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, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 97 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI1 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital232 mio100 ax114 hnf100 lsp73 ukn44 mio100 lsp43 div100 bol100 ite100 ukn100 eq154 hnf92 smp100 dnf160 smp86 tf101 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 16:01:16,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:16,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:17,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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