./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.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-regression/ex3_forlist.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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:59:57,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:59:57,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:59:57,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:59:57,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:59:57,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:59:57,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:59:57,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:59:57,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:59:57,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:59:57,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:59:57,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:59:57,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:59:57,539 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:59:57,540 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:59:57,540 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:59:57,540 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:59:57,540 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:59:57,540 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:59:57,540 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:59:57,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:59:57,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:59:57,540 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:59:57,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:59:57,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:59:57,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:59:57,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:59:57,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:59:57,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:59:57,541 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:59:57,541 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:59:57,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:59:57,542 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:59:57,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:59:57,542 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:59:57,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:59:57,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:59:57,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:59:57,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:59:57,542 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:59:57,542 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2025-03-04 15:59:57,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:59:57,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:59:57,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:59:57,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:59:57,810 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:59:57,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2025-03-04 15:59:58,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90ec284b/9dbdd07f674241d5819d2e4cc4fe9e6b/FLAG963e74c6d [2025-03-04 15:59:59,147 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:59:59,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2025-03-04 15:59:59,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90ec284b/9dbdd07f674241d5819d2e4cc4fe9e6b/FLAG963e74c6d [2025-03-04 15:59:59,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90ec284b/9dbdd07f674241d5819d2e4cc4fe9e6b [2025-03-04 15:59:59,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:59:59,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:59:59,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:59:59,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:59:59,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:59:59,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd875c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59, skipping insertion in model container [2025-03-04 15:59:59,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:59:59,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:59:59,643 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:59:59,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:59:59,674 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:59:59,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59 WrapperNode [2025-03-04 15:59:59,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:59:59,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:59:59,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:59:59,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:59:59,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,702 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 126 [2025-03-04 15:59:59,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:59:59,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:59:59,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:59:59,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:59:59,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,730 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 8 writes are split as follows [0, 3, 5]. [2025-03-04 15:59:59,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:59:59,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:59:59,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:59:59,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:59:59,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (1/1) ... [2025-03-04 15:59:59,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:59:59,783 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 15:59:59,789 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 15:59:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:59:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:59:59,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:59:59,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:59:59,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:59:59,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:59:59,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:59:59,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:59:59,881 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:59:59,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:00:00,103 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc fake_malloc_#t~post10#1; [2025-03-04 16:00:00,103 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-2: havoc fake_malloc_#t~post10#1; [2025-03-04 16:00:00,114 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-03-04 16:00:00,114 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:00:00,120 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:00:00,120 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:00:00,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:00 BoogieIcfgContainer [2025-03-04 16:00:00,120 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:00:00,121 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:00:00,121 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:00:00,125 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:00:00,125 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:00:00,125 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:59:59" (1/3) ... [2025-03-04 16:00:00,126 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4836c0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:00:00, skipping insertion in model container [2025-03-04 16:00:00,127 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:00:00,127 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:59" (2/3) ... [2025-03-04 16:00:00,127 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4836c0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:00:00, skipping insertion in model container [2025-03-04 16:00:00,127 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:00:00,127 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:00" (3/3) ... [2025-03-04 16:00:00,128 INFO L363 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2025-03-04 16:00:00,163 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:00:00,164 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:00:00,164 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:00:00,164 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:00:00,164 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:00:00,164 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:00:00,164 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:00:00,164 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:00:00,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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:00:00,182 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2025-03-04 16:00:00,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:00,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:00,188 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:00:00,188 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:00:00,189 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:00:00,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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:00:00,191 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2025-03-04 16:00:00,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:00,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:00,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:00:00,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:00:00,197 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" [2025-03-04 16:00:00,197 INFO L754 eck$LassoCheckResult]: Loop: "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" [2025-03-04 16:00:00,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2720, now seen corresponding path program 1 times [2025-03-04 16:00:00,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:00,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948618399] [2025-03-04 16:00:00,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:00,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:00,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:00,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:00,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:00,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:00,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:00,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:00,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:00,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:00,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:00,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:00,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2025-03-04 16:00:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:00,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219846263] [2025-03-04 16:00:00,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:00,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:00:00,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:00:00,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:00,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:00,309 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:00,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:00:00,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:00:00,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:00,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:00,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:00,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash 84372, now seen corresponding path program 1 times [2025-03-04 16:00:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:00,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279705552] [2025-03-04 16:00:00,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:00,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:00,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:00,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:00,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:00,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:00,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:00,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:00,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:00,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:00,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:00,872 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:00:00,873 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:00:00,873 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:00:00,873 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:00:00,873 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:00:00,873 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:00,873 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:00:00,873 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:00:00,873 INFO L132 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2025-03-04 16:00:00,873 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:00:00,874 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:00:00,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:00,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:00,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:00,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:00,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:00,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:00,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:01,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:01,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:01,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:01,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:01,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:01,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:01,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:01,569 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:00:01,572 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:00:01,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,575 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:00:01,576 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:00:01,577 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:00:01,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:01,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:01,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:01,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,600 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:00:01,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,603 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:00:01,604 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:00:01,605 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:00:01,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:01,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:01,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,629 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:00:01,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,632 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:00:01,634 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:00:01,635 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:00:01,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:01,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:01,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:01,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,661 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:00:01,663 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:00:01,664 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:00:01,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:01,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:01,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:01,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,683 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:00:01,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,685 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:00:01,686 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:00:01,687 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:00:01,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:01,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:01,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:01,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,705 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:00:01,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,707 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:00:01,708 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:00:01,709 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:00:01,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:01,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:01,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:01,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,726 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:00:01,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,729 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:00:01,729 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:00:01,730 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:00:01,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:01,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:01,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:01,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 16:00:01,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,749 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:00:01,750 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:00:01,751 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:00:01,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:01,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:01,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,771 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:00:01,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,774 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:00:01,775 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:00:01,776 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:00:01,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:01,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:01,794 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,799 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:00:01,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,802 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:00:01,804 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:00:01,804 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:00:01,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:01,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:01,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,828 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:00:01,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,831 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:00:01,832 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:00:01,833 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:00:01,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:01,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:01,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:01,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:01,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,854 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:00:01,856 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:00:01,857 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:00:01,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:01,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:01,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 16:00:01,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,881 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:00:01,882 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:00:01,883 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:00:01,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:01,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:01,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,903 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:00:01,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,906 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:00:01,907 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:00:01,908 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:00:01,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:01,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:01,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:01,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,932 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:00:01,934 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:00:01,936 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:00:01,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:01,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:01,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,959 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:00:01,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,961 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:00:01,963 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:00:01,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:00:01,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:01,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:01,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:01,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:01,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:01,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:01,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:01,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:01,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:01,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:01,986 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:00:01,988 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:00:01,990 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:00:02,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:02,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:02,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:02,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:02,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:02,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:02,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:02,013 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:00:02,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:02,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:02,016 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:00:02,017 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:00:02,020 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:00:02,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:02,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:02,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:02,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:02,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:02,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:02,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:02,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:02,038 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:00:02,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:02,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:02,041 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:00:02,041 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:00:02,044 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:00:02,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:02,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:02,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:02,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:02,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:02,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:02,073 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:00:02,121 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-03-04 16:00:02,123 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-03-04 16:00:02,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:02,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:02,127 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:00:02,128 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:00:02,129 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:00:02,140 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:00:02,141 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:00:02,141 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_~i~0#1) = -2*ULTIMATE.start_init_~i~0#1 + 3 Supporting invariants [] [2025-03-04 16:00:02,148 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:00:02,182 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2025-03-04 16:00:02,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:02,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:02,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:02,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:02,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:00:02,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:02,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:00:02,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:00:02,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:02,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:00:02,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:02,253 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:00:02,271 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:00:02,272 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:02,293 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 47 transitions. Complement of second has 3 states. [2025-03-04 16:00:02,295 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:00:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-04 16:00:02,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-04 16:00:02,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:00:02,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-04 16:00:02,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:00:02,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 16:00:02,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:00:02,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2025-03-04 16:00:02,303 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2025-03-04 16:00:02,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 42 transitions. [2025-03-04 16:00:02,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-04 16:00:02,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-03-04 16:00:02,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2025-03-04 16:00:02,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:00:02,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-04 16:00:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2025-03-04 16:00:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 16:00:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 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:00:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-03-04 16:00:02,322 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-04 16:00:02,322 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-04 16:00:02,322 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:00:02,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2025-03-04 16:00:02,323 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2025-03-04 16:00:02,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:02,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:02,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:02,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:00:02,324 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2025-03-04 16:00:02,324 INFO L754 eck$LassoCheckResult]: Loop: "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2025-03-04 16:00:02,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash 612392913, now seen corresponding path program 1 times [2025-03-04 16:00:02,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:02,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923930691] [2025-03-04 16:00:02,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:02,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:02,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:00:02,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:00:02,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:02,394 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:00:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923930691] [2025-03-04 16:00:02,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923930691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:00:02,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:00:02,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:00:02,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297854114] [2025-03-04 16:00:02,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:00:02,400 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:00:02,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2176, now seen corresponding path program 1 times [2025-03-04 16:00:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835251066] [2025-03-04 16:00:02,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:02,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:02,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:02,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:02,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:02,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:02,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:02,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:02,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:02,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 16:00:02,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:02,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:00:02,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:00:02,489 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:00:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:02,501 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2025-03-04 16:00:02,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2025-03-04 16:00:02,503 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-03-04 16:00:02,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 33 transitions. [2025-03-04 16:00:02,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-04 16:00:02,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-04 16:00:02,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2025-03-04 16:00:02,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:00:02,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-04 16:00:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2025-03-04 16:00:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-04 16:00:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 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:00:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-04 16:00:02,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-04 16:00:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:00:02,508 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-04 16:00:02,508 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:00:02,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2025-03-04 16:00:02,509 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-03-04 16:00:02,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:02,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:02,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:02,509 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:00:02,509 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2025-03-04 16:00:02,509 INFO L754 eck$LassoCheckResult]: Loop: "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2025-03-04 16:00:02,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1777621341, now seen corresponding path program 1 times [2025-03-04 16:00:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:02,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419348203] [2025-03-04 16:00:02,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:02,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:00:02,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:00:02,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:02,574 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:00:02,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419348203] [2025-03-04 16:00:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419348203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:00:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595098560] [2025-03-04 16:00:02,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:02,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:00:02,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:02,576 INFO L229 MonitoredProcess]: Starting monitored process 22 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:00:02,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 16:00:02,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:00:02,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:00:02,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:02,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 16:00:02,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:02,644 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:00:02,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:00:02,660 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:00:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595098560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:00:02,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:00:02,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-04 16:00:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703806606] [2025-03-04 16:00:02,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:00:02,661 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:00:02,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2176, now seen corresponding path program 2 times [2025-03-04 16:00:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:02,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242276147] [2025-03-04 16:00:02,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:00:02,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:02,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:02,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:02,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:00:02,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:02,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:02,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:02,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:02,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:02,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:02,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:02,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:00:02,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:00:02,729 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:00:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:02,746 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2025-03-04 16:00:02,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2025-03-04 16:00:02,747 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-03-04 16:00:02,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2025-03-04 16:00:02,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-04 16:00:02,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-04 16:00:02,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2025-03-04 16:00:02,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:00:02,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-04 16:00:02,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2025-03-04 16:00:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 16:00:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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:00:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-03-04 16:00:02,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-04 16:00:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:00:02,753 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-04 16:00:02,753 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:00:02,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2025-03-04 16:00:02,754 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-03-04 16:00:02,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:02,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:02,755 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:02,755 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:00:02,755 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2025-03-04 16:00:02,755 INFO L754 eck$LassoCheckResult]: Loop: "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2025-03-04 16:00:02,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash -755003055, now seen corresponding path program 2 times [2025-03-04 16:00:02,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:02,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694427439] [2025-03-04 16:00:02,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:00:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:02,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-04 16:00:02,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:00:02,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:00:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:02,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:02,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:00:02,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:00:02,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:02,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:02,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2176, now seen corresponding path program 3 times [2025-03-04 16:00:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:02,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404599573] [2025-03-04 16:00:02,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:00:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:02,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:02,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:02,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:00:02,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:02,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:02,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:02,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:02,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:02,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:02,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:02,819 INFO L85 PathProgramCache]: Analyzing trace with hash 291538384, now seen corresponding path program 1 times [2025-03-04 16:00:02,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:02,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385206142] [2025-03-04 16:00:02,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:02,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:02,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:00:02,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:00:02,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:02,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:03,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:03,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385206142] [2025-03-04 16:00:03,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385206142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:00:03,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166068005] [2025-03-04 16:00:03,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:03,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:00:03,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:03,240 INFO L229 MonitoredProcess]: Starting monitored process 23 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:00:03,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 16:00:03,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:00:03,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:00:03,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:03,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:03,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 16:00:03,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:03,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:00:03,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:00:03,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 16:00:03,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 16:00:03,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 16:00:03,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 16:00:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:03,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:00:03,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2025-03-04 16:00:03,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2025-03-04 16:00:03,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2025-03-04 16:00:03,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2025-03-04 16:00:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166068005] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:00:03,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:00:03,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 16:00:03,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710988646] [2025-03-04 16:00:03,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:00:03,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:03,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 16:00:03,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 16:00:03,671 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 13 Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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:00:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:03,799 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-03-04 16:00:03,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2025-03-04 16:00:03,800 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 16:00:03,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 32 transitions. [2025-03-04 16:00:03,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-04 16:00:03,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-04 16:00:03,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2025-03-04 16:00:03,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:00:03,801 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-04 16:00:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2025-03-04 16:00:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 16:00:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 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:00:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-04 16:00:03,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-04 16:00:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 16:00:03,803 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-04 16:00:03,803 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:00:03,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2025-03-04 16:00:03,803 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-04 16:00:03,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:03,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:03,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:03,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:00:03,804 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2025-03-04 16:00:03,804 INFO L754 eck$LassoCheckResult]: Loop: "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2025-03-04 16:00:03,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash 447755283, now seen corresponding path program 1 times [2025-03-04 16:00:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:03,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119180409] [2025-03-04 16:00:03,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:03,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:00:03,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:00:03,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:03,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:03,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:03,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:00:03,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:00:03,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:03,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:03,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:03,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1952, now seen corresponding path program 1 times [2025-03-04 16:00:03,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:03,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990100369] [2025-03-04 16:00:03,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:03,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:03,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:03,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:03,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:03,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:03,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:03,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:03,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:03,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:03,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 796098354, now seen corresponding path program 1 times [2025-03-04 16:00:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436082257] [2025-03-04 16:00:03,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:03,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:00:03,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:00:03,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:03,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:03,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:03,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:00:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:00:03,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:03,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:03,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:18,348 WARN L286 SmtUtils]: Spent 14.40s on a formula simplification. DAG size of input: 288 DAG size of output: 249 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 16:00:18,833 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:00:18,833 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:00:18,833 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:00:18,833 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:00:18,833 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:00:18,833 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:18,833 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:00:18,833 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:00:18,833 INFO L132 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2025-03-04 16:00:18,833 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:00:18,834 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:00:18,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:18,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:19,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:19,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:19,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:00:19,371 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:00:19,372 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:00:19,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,376 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:00:19,377 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:00:19,379 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:00:19,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 16:00:19,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,399 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:00:19,400 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:00:19,401 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:00:19,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,420 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:00:19,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,422 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:00:19,423 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:00:19,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:00:19,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:19,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:19,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,444 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:00:19,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,446 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:00:19,448 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:00:19,448 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:00:19,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:19,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:19,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,470 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:00:19,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,472 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:00:19,473 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:00:19,474 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:00:19,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,492 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:00:19,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,494 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:00:19,495 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:00:19,496 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:00:19,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:19,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:19,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,514 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:00:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,516 INFO L229 MonitoredProcess]: Starting monitored process 30 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:00:19,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 16:00:19,518 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:00:19,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:19,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,536 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:00:19,537 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:00:19,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:00:19,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 16:00:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,556 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:00:19,557 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:00:19,558 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:00:19,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 16:00:19,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,578 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:00:19,579 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:00:19,580 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:00:19,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,596 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:00:19,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,599 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:00:19,599 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:00:19,601 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:00:19,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:19,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:19,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 16:00:19,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,622 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:00:19,622 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:00:19,623 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:00:19,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,640 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:00:19,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,642 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:00:19,643 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:00:19,644 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:00:19,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 16:00:19,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,665 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:00:19,665 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:00:19,667 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:00:19,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:19,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:19,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,687 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:00:19,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,690 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:00:19,691 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:00:19,692 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:00:19,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-04 16:00:19,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,712 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:00:19,712 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:00:19,713 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:00:19,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,730 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:00:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,732 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:00:19,733 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:00:19,733 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:00:19,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,750 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:00:19,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,752 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:00:19,753 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:00:19,754 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:00:19,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:19,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:19,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:19,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,774 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:00:19,774 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:00:19,775 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:00:19,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:19,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:19,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 16:00:19,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,795 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:00:19,796 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:00:19,800 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:00:19,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,811 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,816 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:00:19,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,818 INFO L229 MonitoredProcess]: Starting monitored process 44 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:00:19,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 16:00:19,824 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:00:19,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 16:00:19,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,847 INFO L229 MonitoredProcess]: Starting monitored process 45 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:00:19,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 16:00:19,854 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:00:19,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 16:00:19,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,877 INFO L229 MonitoredProcess]: Starting monitored process 46 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:00:19,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 16:00:19,888 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:00:19,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:19,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:19,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:19,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,908 INFO L229 MonitoredProcess]: Starting monitored process 47 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:00:19,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 16:00:19,920 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:00:19,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:19,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:19,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-04 16:00:19,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,939 INFO L229 MonitoredProcess]: Starting monitored process 48 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:00:19,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 16:00:19,944 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:00:19,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:19,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:19,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:19,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,965 INFO L229 MonitoredProcess]: Starting monitored process 49 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:00:19,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 16:00:19,967 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:00:19,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:19,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:19,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:19,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:19,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:19,986 INFO L229 MonitoredProcess]: Starting monitored process 50 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:00:19,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 16:00:19,988 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:00:19,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:19,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:19,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:19,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:19,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:19,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:19,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:20,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:20,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 16:00:20,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:20,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:20,008 INFO L229 MonitoredProcess]: Starting monitored process 51 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:00:20,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 16:00:20,010 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:00:20,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:20,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:20,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:20,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:20,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:20,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:20,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:20,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:20,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:20,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:20,035 INFO L229 MonitoredProcess]: Starting monitored process 52 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:00:20,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 16:00:20,036 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:00:20,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:20,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:20,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:20,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:20,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:20,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:20,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:20,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:20,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:20,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:20,058 INFO L229 MonitoredProcess]: Starting monitored process 53 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:00:20,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 16:00:20,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:00:20,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:20,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:20,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:20,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:20,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:20,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:20,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:20,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:20,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 16:00:20,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:20,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:20,077 INFO L229 MonitoredProcess]: Starting monitored process 54 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:00:20,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 16:00:20,079 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:00:20,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:20,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:00:20,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:20,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:20,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:20,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:00:20,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:00:20,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:20,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 16:00:20,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:20,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:20,097 INFO L229 MonitoredProcess]: Starting monitored process 55 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:00:20,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 16:00:20,099 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:00:20,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:20,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:20,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:20,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:20,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:20,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:20,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:20,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-04 16:00:20,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:20,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:20,120 INFO L229 MonitoredProcess]: Starting monitored process 56 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:00:20,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 16:00:20,122 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:00:20,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:20,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:20,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:20,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:20,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:20,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:20,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:00:20,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 16:00:20,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:20,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:20,142 INFO L229 MonitoredProcess]: Starting monitored process 57 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:00:20,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 16:00:20,143 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:00:20,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:00:20,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:00:20,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:00:20,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:00:20,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:00:20,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:00:20,161 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:00:20,173 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-04 16:00:20,173 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-04 16:00:20,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:00:20,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:20,199 INFO L229 MonitoredProcess]: Starting monitored process 58 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:00:20,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 16:00:20,200 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:00:20,211 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:00:20,211 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:00:20,211 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_2, ULTIMATE.start_f_~i~1#1) = 1*v_rep(select #length ~#pp~0.base)_2 - 2*ULTIMATE.start_f_~i~1#1 Supporting invariants [] [2025-03-04 16:00:20,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-04 16:00:20,226 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2025-03-04 16:00:20,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 16:00:20,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 16:00:20,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:20,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:00:20,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:00:20,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:20,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:20,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:00:20,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:20,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:00:20,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:00:20,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:20,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:20,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:00:20,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:20,298 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:00:20,299 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:00:20,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:00:20,320 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 29 states and 37 transitions. Complement of second has 5 states. [2025-03-04 16:00:20,321 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:00:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:00:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-03-04 16:00:20,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-04 16:00:20,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:00:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-04 16:00:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:00:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 4 letters. [2025-03-04 16:00:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:00:20,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2025-03-04 16:00:20,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:20,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2025-03-04 16:00:20,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-04 16:00:20,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-04 16:00:20,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2025-03-04 16:00:20,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:00:20,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-03-04 16:00:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2025-03-04 16:00:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-04 16:00:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 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:00:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-04 16:00:20,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-04 16:00:20,326 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-04 16:00:20,326 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:00:20,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2025-03-04 16:00:20,326 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:20,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:20,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:20,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:20,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:00:20,327 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !(f_~i~1#1 < 2);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2025-03-04 16:00:20,327 INFO L754 eck$LassoCheckResult]: Loop: "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2025-03-04 16:00:20,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 796098381, now seen corresponding path program 1 times [2025-03-04 16:00:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110258828] [2025-03-04 16:00:20,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:20,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:00:20,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:00:20,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:20,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:00:20,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:20,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110258828] [2025-03-04 16:00:20,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110258828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:00:20,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:00:20,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:00:20,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824032155] [2025-03-04 16:00:20,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:00:20,366 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:00:20,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash 53583, now seen corresponding path program 1 times [2025-03-04 16:00:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326169344] [2025-03-04 16:00:20,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:20,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:20,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:20,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:20,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:20,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:20,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:20,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:20,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:20,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:20,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:20,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:00:20,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:00:20,424 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:00:20,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:20,435 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2025-03-04 16:00:20,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2025-03-04 16:00:20,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:20,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2025-03-04 16:00:20,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-04 16:00:20,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-04 16:00:20,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2025-03-04 16:00:20,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:00:20,435 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-04 16:00:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2025-03-04 16:00:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-04 16:00:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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:00:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-04 16:00:20,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-04 16:00:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:00:20,437 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-04 16:00:20,437 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:00:20,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2025-03-04 16:00:20,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:20,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:20,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:20,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:20,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:00:20,438 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2025-03-04 16:00:20,438 INFO L754 eck$LassoCheckResult]: Loop: "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2025-03-04 16:00:20,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:20,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1090754838, now seen corresponding path program 1 times [2025-03-04 16:00:20,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:20,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497246110] [2025-03-04 16:00:20,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:20,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:00:20,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:00:20,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:20,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:20,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 16:00:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:00:20,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497246110] [2025-03-04 16:00:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497246110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:00:20,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:00:20,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 16:00:20,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895402170] [2025-03-04 16:00:20,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:00:20,726 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:00:20,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash 53583, now seen corresponding path program 2 times [2025-03-04 16:00:20,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:20,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267612054] [2025-03-04 16:00:20,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:00:20,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:20,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:20,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:20,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:00:20,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:20,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:20,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:20,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:20,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:20,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:20,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:20,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 16:00:20,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 16:00:20,782 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:00:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:20,856 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-04 16:00:20,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2025-03-04 16:00:20,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:20,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 36 transitions. [2025-03-04 16:00:20,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-04 16:00:20,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-04 16:00:20,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2025-03-04 16:00:20,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:00:20,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-04 16:00:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2025-03-04 16:00:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-04 16:00:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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:00:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-04 16:00:20,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-04 16:00:20,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 16:00:20,860 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-04 16:00:20,860 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:00:20,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2025-03-04 16:00:20,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:20,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:20,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:20,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:20,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:00:20,861 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume !(f_~i~1#1 < 2);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2025-03-04 16:00:20,861 INFO L754 eck$LassoCheckResult]: Loop: "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2025-03-04 16:00:20,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:20,862 INFO L85 PathProgramCache]: Analyzing trace with hash 546340524, now seen corresponding path program 1 times [2025-03-04 16:00:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:20,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483191538] [2025-03-04 16:00:20,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:20,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:00:20,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:00:20,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:20,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:00:20,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:20,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483191538] [2025-03-04 16:00:20,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483191538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:00:20,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100154982] [2025-03-04 16:00:20,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:20,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:00:20,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:20,905 INFO L229 MonitoredProcess]: Starting monitored process 59 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:00:20,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-03-04 16:00:20,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:00:20,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:00:20,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:20,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:20,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 16:00:20,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:00:20,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:00:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:00:20,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100154982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:00:20,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:00:20,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-04 16:00:20,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533593920] [2025-03-04 16:00:20,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:00:20,998 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:00:20,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash 53583, now seen corresponding path program 3 times [2025-03-04 16:00:20,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:20,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093023629] [2025-03-04 16:00:20,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:00:20,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:21,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:21,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:21,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:00:21,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:21,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:21,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:21,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:21,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:21,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:21,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:21,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:21,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:00:21,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:00:21,038 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:00:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:21,056 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2025-03-04 16:00:21,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2025-03-04 16:00:21,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:21,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2025-03-04 16:00:21,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-04 16:00:21,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-04 16:00:21,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2025-03-04 16:00:21,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:00:21,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-04 16:00:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2025-03-04 16:00:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 16:00:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 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:00:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-04 16:00:21,058 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-04 16:00:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:00:21,058 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-04 16:00:21,058 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:00:21,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2025-03-04 16:00:21,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:21,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:21,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:21,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:21,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:00:21,059 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2025-03-04 16:00:21,060 INFO L754 eck$LassoCheckResult]: Loop: "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2025-03-04 16:00:21,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash -243313813, now seen corresponding path program 1 times [2025-03-04 16:00:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:21,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690617637] [2025-03-04 16:00:21,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:21,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:00:21,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:00:21,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:21,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:21,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:21,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:00:21,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:00:21,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:21,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:21,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:21,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash 53583, now seen corresponding path program 4 times [2025-03-04 16:00:21,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:21,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693041728] [2025-03-04 16:00:21,104 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:00:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:21,106 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 16:00:21,107 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:21,107 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:00:21,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:21,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:21,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:21,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:21,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:21,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:21,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:21,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:21,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1343016357, now seen corresponding path program 1 times [2025-03-04 16:00:21,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:21,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991851341] [2025-03-04 16:00:21,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:21,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:21,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:00:21,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:00:21,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:21,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:00:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991851341] [2025-03-04 16:00:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991851341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:00:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783476314] [2025-03-04 16:00:21,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:21,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:00:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:21,865 INFO L229 MonitoredProcess]: Starting monitored process 60 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:00:21,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-03-04 16:00:21,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:00:21,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:00:21,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:21,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:21,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 16:00:21,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:22,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:00:22,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:00:22,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 16:00:22,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 16:00:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 16:00:22,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 16:00:22,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 16:00:22,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 16:00:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:00:22,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 16:00:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783476314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:00:22,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 16:00:22,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21 [2025-03-04 16:00:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067795199] [2025-03-04 16:00:22,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:00:22,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:22,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 16:00:22,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-03-04 16:00:22,213 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:00:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:22,311 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-03-04 16:00:22,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2025-03-04 16:00:22,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:22,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2025-03-04 16:00:22,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-04 16:00:22,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-04 16:00:22,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2025-03-04 16:00:22,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:00:22,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-04 16:00:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2025-03-04 16:00:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-04 16:00:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 31 states have internal predecessors, (39), 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:00:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-04 16:00:22,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-04 16:00:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 16:00:22,315 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-04 16:00:22,315 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:00:22,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2025-03-04 16:00:22,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:22,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:22,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:22,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:22,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:00:22,317 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2025-03-04 16:00:22,317 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == g_#t~mem8#1;" "havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2025-03-04 16:00:22,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:22,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1896339543, now seen corresponding path program 1 times [2025-03-04 16:00:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:22,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572617076] [2025-03-04 16:00:22,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:22,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 16:00:22,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 16:00:22,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:22,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:22,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:22,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 16:00:22,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 16:00:22,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:22,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:22,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:22,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:22,371 INFO L85 PathProgramCache]: Analyzing trace with hash 48514929, now seen corresponding path program 1 times [2025-03-04 16:00:22,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:22,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808451604] [2025-03-04 16:00:22,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:22,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:00:22,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:00:22,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:22,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:22,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:22,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:00:22,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:00:22,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:22,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:22,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:22,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:22,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1164269367, now seen corresponding path program 1 times [2025-03-04 16:00:22,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:22,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651526081] [2025-03-04 16:00:22,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:22,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:22,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:00:22,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:00:22,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:22,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:00:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651526081] [2025-03-04 16:00:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651526081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:00:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156853429] [2025-03-04 16:00:22,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:22,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:00:22,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:22,806 INFO L229 MonitoredProcess]: Starting monitored process 61 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:00:22,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-03-04 16:00:22,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:00:22,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:00:22,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:22,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:22,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 16:00:22,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:22,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:00:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:00:23,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:00:23,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-04 16:00:23,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 16:00:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 16:00:23,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156853429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:00:23,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:00:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2025-03-04 16:00:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526171289] [2025-03-04 16:00:23,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:00:23,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:23,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 16:00:23,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-04 16:00:23,273 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 11 Second operand has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 23 states have internal predecessors, (50), 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:00:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:23,596 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-04 16:00:23,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2025-03-04 16:00:23,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:23,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 52 transitions. [2025-03-04 16:00:23,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-04 16:00:23,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-04 16:00:23,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2025-03-04 16:00:23,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:00:23,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-04 16:00:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2025-03-04 16:00:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-03-04 16:00:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 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:00:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-03-04 16:00:23,598 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-04 16:00:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 16:00:23,599 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-04 16:00:23,599 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 16:00:23,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2025-03-04 16:00:23,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:23,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:23,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:23,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:23,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:00:23,600 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume !(f_~i~1#1 < 2);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2025-03-04 16:00:23,600 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == g_#t~mem8#1;" "havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2025-03-04 16:00:23,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1345044105, now seen corresponding path program 1 times [2025-03-04 16:00:23,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:23,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407449022] [2025-03-04 16:00:23,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:23,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:23,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:00:23,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:00:23,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:23,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:24,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:24,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407449022] [2025-03-04 16:00:24,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407449022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:00:24,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288162307] [2025-03-04 16:00:24,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:24,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:00:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,035 INFO L229 MonitoredProcess]: Starting monitored process 62 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:00:24,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-03-04 16:00:24,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:00:24,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:00:24,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:24,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:24,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 16:00:24,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:24,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:00:24,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:00:24,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 16:00:24,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 16:00:24,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 16:00:24,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 16:00:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:24,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:00:24,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 16:00:24,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 16:00:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:00:24,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288162307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:00:24,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:00:24,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2025-03-04 16:00:24,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97680197] [2025-03-04 16:00:24,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:00:24,440 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:00:24,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash 48514929, now seen corresponding path program 2 times [2025-03-04 16:00:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541827497] [2025-03-04 16:00:24,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:00:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:24,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:00:24,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:00:24,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:00:24,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:24,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:24,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:00:24,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:00:24,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:24,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:24,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:24,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:24,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 16:00:24,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-03-04 16:00:24,586 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 12 Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 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:00:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:24,820 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-04 16:00:24,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2025-03-04 16:00:24,820 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:24,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 43 transitions. [2025-03-04 16:00:24,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-03-04 16:00:24,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-04 16:00:24,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2025-03-04 16:00:24,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:00:24,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-04 16:00:24,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2025-03-04 16:00:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 16:00:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 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:00:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-04 16:00:24,822 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-04 16:00:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 16:00:24,823 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-04 16:00:24,823 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 16:00:24,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2025-03-04 16:00:24,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 16:00:24,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:00:24,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:00:24,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:00:24,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:00:24,825 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume init_~i~0#1 < 2;call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume f_~i~1#1 < 2;call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "assume 1 == g_#t~mem8#1;" "havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" [2025-03-04 16:00:24,825 INFO L754 eck$LassoCheckResult]: Loop: "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume g_~i~2#1 < 2;call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" [2025-03-04 16:00:24,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1407215172, now seen corresponding path program 1 times [2025-03-04 16:00:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:24,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891992433] [2025-03-04 16:00:24,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:24,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 16:00:24,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 16:00:24,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:24,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 16:00:24,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:00:24,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891992433] [2025-03-04 16:00:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891992433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:00:24,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876027518] [2025-03-04 16:00:24,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:00:24,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:00:24,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:00:24,886 INFO L229 MonitoredProcess]: Starting monitored process 63 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:00:24,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-03-04 16:00:24,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 16:00:24,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 16:00:24,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:24,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:00:24,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:00:24,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:00:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 16:00:25,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 16:00:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876027518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:00:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 16:00:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-04 16:00:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874908213] [2025-03-04 16:00:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:00:25,010 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:00:25,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:00:25,010 INFO L85 PathProgramCache]: Analyzing trace with hash 44973, now seen corresponding path program 5 times [2025-03-04 16:00:25,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:00:25,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254956459] [2025-03-04 16:00:25,010 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:00:25,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:00:25,013 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:25,014 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:25,014 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:00:25,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:25,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:00:25,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:00:25,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:00:25,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:00:25,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:00:25,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:00:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:00:25,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:00:25,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:00:25,056 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:00:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:00:25,082 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2025-03-04 16:00:25,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2025-03-04 16:00:25,082 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:00:25,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2025-03-04 16:00:25,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:00:25,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:00:25,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:00:25,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:00:25,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:00:25,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:00:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 16:00:25,083 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:00:25,084 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 16:00:25,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:00:25,084 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:00:25,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:00:25,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:00:25 BoogieIcfgContainer [2025-03-04 16:00:25,093 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:00:25,093 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:00:25,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:00:25,094 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:00:25,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:00" (3/4) ... [2025-03-04 16:00:25,095 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:00:25,096 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:00:25,096 INFO L158 Benchmark]: Toolchain (without parser) took 25592.81ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 113.1MB in the beginning and 170.7MB in the end (delta: -57.6MB). Peak memory consumption was 264.1MB. Max. memory is 16.1GB. [2025-03-04 16:00:25,097 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:00:25,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.65ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:00:25,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.49ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:00:25,097 INFO L158 Benchmark]: Boogie Preprocessor took 48.00ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:00:25,097 INFO L158 Benchmark]: IcfgBuilder took 367.20ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 80.4MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:00:25,097 INFO L158 Benchmark]: BuchiAutomizer took 24971.69ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 80.4MB in the beginning and 170.8MB in the end (delta: -90.3MB). Peak memory consumption was 230.5MB. Max. memory is 16.1GB. [2025-03-04 16:00:25,098 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 469.8MB. Free memory was 170.8MB in the beginning and 170.7MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:00:25,098 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.65ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.49ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.00ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 367.20ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 80.4MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 24971.69ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 80.4MB in the beginning and 170.8MB in the end (delta: -90.3MB). Peak memory consumption was 230.5MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 469.8MB. Free memory was 170.8MB in the beginning and 170.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 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (3 + ((long long) -2 * i)) and consists of 2 locations. One deterministic module has affine ranking function null and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.9s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 23.6s. Construction of modules took 0.5s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 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, 185 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 942 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 705 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 939 IncrementalHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 237 mSDtfsCounter, 939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU7 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital307 mio100 ax100 hnf100 lsp74 ukn63 mio100 lsp39 div100 bol100 ite100 ukn100 eq165 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms 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:00:25,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2025-03-04 16:00:25,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:25,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-03-04 16:00:25,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-03-04 16:00:25,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:26,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 16:00:26,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 16:00:26,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE