./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:04:17,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:04:17,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:04:17,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:04:17,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:04:17,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:04:17,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:04:17,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:04:17,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:04:17,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:04:17,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:04:17,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:04:17,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:04:17,780 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:04:17,780 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:04:17,780 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:04:17,780 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:04:17,781 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:04:17,781 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:04:17,781 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:04:17,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:04:17,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:04:17,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:04:17,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:04:17,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:04:17,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:04:17,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:04:17,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:04:17,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:04:17,782 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:04:17,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:04:17,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:04:17,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:04:17,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:04:17,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:04:17,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:04:17,783 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:04:17,783 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c [2025-02-06 19:04:18,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:04:18,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:04:18,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:04:18,060 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:04:18,060 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:04:18,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2025-02-06 19:04:19,314 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82dc3f17f/53d363901bc045bd8cdfc54c333dac25/FLAG9a56a44eb [2025-02-06 19:04:19,572 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:04:19,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2025-02-06 19:04:19,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82dc3f17f/53d363901bc045bd8cdfc54c333dac25/FLAG9a56a44eb [2025-02-06 19:04:19,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82dc3f17f/53d363901bc045bd8cdfc54c333dac25 [2025-02-06 19:04:19,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:04:19,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:04:19,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:04:19,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:04:19,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:04:19,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:19,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab977d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19, skipping insertion in model container [2025-02-06 19:04:19,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:19,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:04:19,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:04:19,916 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:04:19,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:04:19,979 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:04:19,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19 WrapperNode [2025-02-06 19:04:19,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:04:19,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:04:19,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:04:19,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:04:19,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,021 INFO L138 Inliner]: procedures = 111, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 186 [2025-02-06 19:04:20,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:04:20,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:04:20,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:04:20,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:04:20,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,050 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [12, 6, 10, 8, 6]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0, 0]. The 20 writes are split as follows [6, 2, 6, 4, 2]. [2025-02-06 19:04:20,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:04:20,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:04:20,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:04:20,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:04:20,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (1/1) ... [2025-02-06 19:04:20,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:20,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:20,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:20,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:04:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:04:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:04:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 19:04:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 19:04:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 19:04:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:04:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:04:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 19:04:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 19:04:20,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 19:04:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:04:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:04:20,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:04:20,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:04:20,240 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:04:20,241 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:04:20,535 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-06 19:04:20,535 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:04:20,549 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:04:20,550 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:04:20,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:04:20 BoogieIcfgContainer [2025-02-06 19:04:20,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:04:20,551 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:04:20,551 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:04:20,556 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:04:20,557 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:04:20,557 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:04:19" (1/3) ... [2025-02-06 19:04:20,558 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6566c207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:04:20, skipping insertion in model container [2025-02-06 19:04:20,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:04:20,559 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:19" (2/3) ... [2025-02-06 19:04:20,560 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6566c207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:04:20, skipping insertion in model container [2025-02-06 19:04:20,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:04:20,560 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:04:20" (3/3) ... [2025-02-06 19:04:20,562 INFO L363 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2025-02-06 19:04:20,605 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:04:20,606 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:04:20,606 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:04:20,607 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:04:20,607 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:04:20,608 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:04:20,608 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:04:20,608 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:04:20,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:20,629 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-02-06 19:04:20,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:20,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:20,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:04:20,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:04:20,634 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:04:20,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:20,638 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2025-02-06 19:04:20,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:20,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:20,639 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:04:20,639 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:04:20,648 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 2;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#4(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#2(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#1(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#0(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1;" "assume true;" [2025-02-06 19:04:20,648 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call f_#t~mem8#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume f_#t~mem8#1 < f_#t~mem9#1;havoc f_#t~mem8#1;havoc f_#t~mem9#1;call f_#t~mem10#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call write~int#0(2 * f_#t~mem10#1, f_~z~0#1.base, f_~z~0#1.offset, 4);havoc f_#t~mem10#1;" [2025-02-06 19:04:20,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash 78221199, now seen corresponding path program 1 times [2025-02-06 19:04:20,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11937176] [2025-02-06 19:04:20,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:20,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:04:20,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:04:20,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:20,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:20,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:20,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:04:20,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:04:20,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:20,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:20,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:20,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 1 times [2025-02-06 19:04:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:20,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064169164] [2025-02-06 19:04:20,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:20,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:20,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:04:20,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:04:20,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:20,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:20,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:20,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:04:20,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:04:20,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:20,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:20,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:20,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2138837682, now seen corresponding path program 1 times [2025-02-06 19:04:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259198210] [2025-02-06 19:04:20,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:20,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:04:20,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:04:20,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:20,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:04:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259198210] [2025-02-06 19:04:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259198210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:04:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:04:21,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:04:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866147786] [2025-02-06 19:04:21,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:04:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:04:21,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:04:21,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 19:04:21,507 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:04:21,596 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2025-02-06 19:04:21,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2025-02-06 19:04:21,598 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-02-06 19:04:21,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 33 states and 42 transitions. [2025-02-06 19:04:21,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-02-06 19:04:21,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-02-06 19:04:21,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2025-02-06 19:04:21,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:04:21,607 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-02-06 19:04:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2025-02-06 19:04:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2025-02-06 19:04:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-02-06 19:04:21,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-02-06 19:04:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:04:21,633 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-02-06 19:04:21,633 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:04:21,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2025-02-06 19:04:21,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-06 19:04:21,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:21,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:21,635 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:21,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:04:21,635 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 2;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#4(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#2(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#1(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#0(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1;" "assume true;" "assume true;call f_#t~mem8#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1;" "assume true;" [2025-02-06 19:04:21,635 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume f_#t~short13#1;call f_#t~mem12#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1;" "assume !(0 != f_#t~nondet14#1);havoc f_#t~nondet14#1;call f_#t~mem19#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);call f_#t~mem20#1 := read~int#4(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#2(f_#t~mem19#1 - f_#t~mem20#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~mem19#1;havoc f_#t~mem20#1;" [2025-02-06 19:04:21,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1879458694, now seen corresponding path program 1 times [2025-02-06 19:04:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:21,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772707535] [2025-02-06 19:04:21,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:21,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:04:21,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:04:21,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:21,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:21,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:21,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:04:21,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:04:21,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:21,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:21,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:21,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2060507, now seen corresponding path program 1 times [2025-02-06 19:04:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:21,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070939388] [2025-02-06 19:04:21,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:21,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:21,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:21,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:21,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:21,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:21,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:21,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:21,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:21,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:21,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:21,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1266960596, now seen corresponding path program 1 times [2025-02-06 19:04:21,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:21,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36222177] [2025-02-06 19:04:21,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:21,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:21,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:04:21,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:04:21,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:21,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:21,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:21,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:04:21,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:04:21,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:21,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:21,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:23,610 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:04:23,611 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:04:23,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:04:23,611 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:04:23,611 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:04:23,611 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,611 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:04:23,611 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:04:23,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration2_Lasso [2025-02-06 19:04:23,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:04:23,612 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:04:23,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:23,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:24,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:24,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:24,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:24,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:24,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:25,112 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:04:25,115 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:04:25,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:04:25,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:25,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:04:25,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:25,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:04:25,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:04:25,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:04:25,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,242 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:04:25,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:04:25,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:25,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:25,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:04:25,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:04:25,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-06 19:04:25,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:04:25,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:04:25,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,351 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:04:25,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-06 19:04:25,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,378 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:04:25,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:25,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,404 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:04:25,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:25,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,428 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:04:25,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 19:04:25,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,450 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:04:25,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 19:04:25,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,473 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:04:25,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:25,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:25,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-06 19:04:25,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,498 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:04:25,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:25,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:25,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:25,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 19:04:25,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,523 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:04:25,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:25,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:25,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:25,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:04:25,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,554 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:04:25,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:25,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:25,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:25,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:25,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:25,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:25,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:25,597 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:04:25,629 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-02-06 19:04:25,632 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:04:25,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:25,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:25,638 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:25,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:04:25,641 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:04:25,656 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:04:25,656 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:04:25,657 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_f_~y~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_f_~y~0#1.base) 0)_1 Supporting invariants [1*v_rep(select (select #memory_int#4 ULTIMATE.start_f_~d_ref~0#1.base) ULTIMATE.start_f_~d_ref~0#1.offset)_1 - 2 >= 0] [2025-02-06 19:04:25,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-06 19:04:25,878 INFO L156 tatePredicateManager]: 54 out of 56 supporting invariants were superfluous and have been removed [2025-02-06 19:04:25,886 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-06 19:04:25,887 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-06 19:04:25,887 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2025-02-06 19:04:25,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:25,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:04:25,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:04:25,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:25,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:25,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:04:25,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:26,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 19:04:26,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:26,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:26,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:26,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:26,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:04:26,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:26,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:04:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:26,201 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-06 19:04:26,202 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:26,302 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 33 states and 42 transitions. Complement of second has 10 states. [2025-02-06 19:04:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 19:04:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2025-02-06 19:04:26,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-06 19:04:26,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:26,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 12 letters. Loop has 4 letters. [2025-02-06 19:04:26,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:26,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 8 letters. [2025-02-06 19:04:26,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:26,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 42 transitions. [2025-02-06 19:04:26,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-06 19:04:26,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 41 transitions. [2025-02-06 19:04:26,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-02-06 19:04:26,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-02-06 19:04:26,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2025-02-06 19:04:26,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:04:26,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-02-06 19:04:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2025-02-06 19:04:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-02-06 19:04:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-02-06 19:04:26,322 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-02-06 19:04:26,322 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-02-06 19:04:26,322 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:04:26,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2025-02-06 19:04:26,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-06 19:04:26,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:26,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:26,324 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:26,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:04:26,325 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume 0 != main_#t~nondet21#1;havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#4(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#2(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#1(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#0(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1;" "assume true;" "assume true;call f_#t~mem8#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1;" "assume true;" [2025-02-06 19:04:26,325 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume f_#t~short13#1;call f_#t~mem12#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1;" "assume !(0 != f_#t~nondet14#1);havoc f_#t~nondet14#1;call f_#t~mem19#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);call f_#t~mem20#1 := read~int#4(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#2(f_#t~mem19#1 - f_#t~mem20#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~mem19#1;havoc f_#t~mem20#1;" [2025-02-06 19:04:26,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1675922202, now seen corresponding path program 1 times [2025-02-06 19:04:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092232844] [2025-02-06 19:04:26,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:26,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:04:26,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:04:26,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:26,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:26,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:26,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:04:26,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:04:26,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:26,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:26,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:26,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1290907, now seen corresponding path program 1 times [2025-02-06 19:04:26,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:26,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723566492] [2025-02-06 19:04:26,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:26,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:26,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:26,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:26,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:26,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:26,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:26,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:26,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:26,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:26,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:26,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:26,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:26,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2048592180, now seen corresponding path program 1 times [2025-02-06 19:04:26,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:26,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528526095] [2025-02-06 19:04:26,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:26,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:26,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:04:26,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:04:26,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:26,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:26,433 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:26,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:04:26,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:04:26,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:26,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:26,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:28,328 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:04:28,329 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:04:28,329 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:04:28,329 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:04:28,329 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:04:28,329 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:28,329 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:04:28,329 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:04:28,329 INFO L132 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration3_Lasso [2025-02-06 19:04:28,329 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:04:28,329 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:04:28,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:28,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:28,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:28,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:28,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:28,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:28,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:28,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:28,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:29,732 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:04:29,732 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:04:29,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,734 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:04:29,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:29,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:29,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:29,748 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:29,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 19:04:29,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,755 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:04:29,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:29,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:29,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:29,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:29,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-06 19:04:29,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,779 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 19:04:29,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:29,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:29,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:29,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-06 19:04:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,807 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:04:29,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:29,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:29,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:29,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:29,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 19:04:29,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,832 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:04:29,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:29,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:29,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:29,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:29,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:04:29,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,854 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:04:29,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:29,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:29,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:29,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:29,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 19:04:29,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,875 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:04:29,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:29,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:29,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:29,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:29,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 19:04:29,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,895 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:04:29,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:29,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:29,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:29,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:29,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:04:29,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,917 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 19:04:29,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:29,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:29,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:29,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-06 19:04:29,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,947 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 19:04:29,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:29,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:29,972 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:29,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:04:29,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:29,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:29,982 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:29,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 19:04:29,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:29,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:29,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:29,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:29,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:29,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:29,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:30,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:30,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-06 19:04:30,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:30,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:30,011 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:30,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-06 19:04:30,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:30,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:30,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:30,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:30,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:30,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:30,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:30,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:04:30,044 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-06 19:04:30,045 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:04:30,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:30,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:30,047 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:30,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-06 19:04:30,049 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:04:30,060 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:04:30,060 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:04:30,060 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_f_~y~0#1.base) ULTIMATE.start_f_~y~0#1.offset)_2) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_f_~y~0#1.base) ULTIMATE.start_f_~y~0#1.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int#4 ULTIMATE.start_f_~d_ref~0#1.base) ULTIMATE.start_f_~d_ref~0#1.offset)_2 - 1 >= 0] [2025-02-06 19:04:30,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-06 19:04:30,243 INFO L156 tatePredicateManager]: 55 out of 56 supporting invariants were superfluous and have been removed [2025-02-06 19:04:30,246 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-06 19:04:30,246 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-06 19:04:30,246 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2025-02-06 19:04:30,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:30,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:04:30,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:04:30,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:30,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:30,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:04:30,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:30,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 19:04:30,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:30,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:30,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:30,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:30,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:04:30,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:30,447 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-06 19:04:30,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:30,518 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 41 states and 54 transitions. Complement of second has 10 states. [2025-02-06 19:04:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 19:04:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2025-02-06 19:04:30,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-06 19:04:30,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:30,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 12 letters. Loop has 4 letters. [2025-02-06 19:04:30,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:30,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 8 letters. [2025-02-06 19:04:30,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:30,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 54 transitions. [2025-02-06 19:04:30,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-06 19:04:30,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 53 transitions. [2025-02-06 19:04:30,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-02-06 19:04:30,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-02-06 19:04:30,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2025-02-06 19:04:30,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:04:30,523 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-02-06 19:04:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2025-02-06 19:04:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-02-06 19:04:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2025-02-06 19:04:30,525 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 52 transitions. [2025-02-06 19:04:30,525 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2025-02-06 19:04:30,525 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:04:30,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 52 transitions. [2025-02-06 19:04:30,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-06 19:04:30,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:30,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:30,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:30,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:04:30,527 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 2;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#4(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#2(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#1(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#0(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1;" "assume true;" "assume true;call f_#t~mem8#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1;" "assume true;" "assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume !f_#t~short13#1;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1;" "assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1;" [2025-02-06 19:04:30,527 INFO L754 eck$LassoCheckResult]: Loop: "call f_#t~mem15#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);call f_#t~mem16#1 := read~int#4(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(f_#t~mem15#1 - f_#t~mem16#1, f_~x~0#1.base, f_~x~0#1.offset, 4);havoc f_#t~nondet17#1;call write~int#2(f_#t~nondet17#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~nondet17#1;call f_#t~mem18#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call write~int#0(f_#t~mem18#1 - 1, f_~z~0#1.base, f_~z~0#1.offset, 4);havoc f_#t~mem18#1;" "assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume f_#t~short13#1;call f_#t~mem12#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1;" "assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1;" [2025-02-06 19:04:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1266961556, now seen corresponding path program 1 times [2025-02-06 19:04:30,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:30,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654982299] [2025-02-06 19:04:30,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:30,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:04:30,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:04:30,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:30,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:30,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-06 19:04:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:30,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:04:30,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654982299] [2025-02-06 19:04:30,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654982299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:04:30,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:04:30,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:04:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872701053] [2025-02-06 19:04:30,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:04:30,582 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:04:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 55624724, now seen corresponding path program 1 times [2025-02-06 19:04:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133332731] [2025-02-06 19:04:30,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:30,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:04:30,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:04:30,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:30,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:30,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:30,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:04:30,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:04:30,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:30,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:30,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:30,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:04:30,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:04:30,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:04:30,844 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:04:30,859 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-02-06 19:04:30,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 52 transitions. [2025-02-06 19:04:30,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-06 19:04:30,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 39 states and 46 transitions. [2025-02-06 19:04:30,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-02-06 19:04:30,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-02-06 19:04:30,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2025-02-06 19:04:30,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:04:30,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-02-06 19:04:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2025-02-06 19:04:30,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-06 19:04:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 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-02-06 19:04:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-02-06 19:04:30,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-02-06 19:04:30,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:04:30,865 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-02-06 19:04:30,865 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:04:30,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2025-02-06 19:04:30,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-06 19:04:30,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:30,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:30,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:30,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:04:30,866 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 2;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#4(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#2(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#1(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#0(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1;" "assume true;" "assume true;call f_#t~mem8#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1;" "assume true;" "assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume f_#t~short13#1;call f_#t~mem12#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1;" "assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1;" [2025-02-06 19:04:30,866 INFO L754 eck$LassoCheckResult]: Loop: "call f_#t~mem15#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);call f_#t~mem16#1 := read~int#4(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(f_#t~mem15#1 - f_#t~mem16#1, f_~x~0#1.base, f_~x~0#1.offset, 4);havoc f_#t~nondet17#1;call write~int#2(f_#t~nondet17#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~nondet17#1;call f_#t~mem18#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call write~int#0(f_#t~mem18#1 - 1, f_~z~0#1.base, f_~z~0#1.offset, 4);havoc f_#t~mem18#1;" "assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume f_#t~short13#1;call f_#t~mem12#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1;" "assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1;" [2025-02-06 19:04:30,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1266960595, now seen corresponding path program 1 times [2025-02-06 19:04:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:30,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388316676] [2025-02-06 19:04:30,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:30,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:30,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:04:30,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:04:30,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:30,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:30,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:30,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:04:30,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:04:30,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:30,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:30,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:30,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash 55624724, now seen corresponding path program 2 times [2025-02-06 19:04:30,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:30,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365288542] [2025-02-06 19:04:30,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:04:30,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:30,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:04:30,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:04:30,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:04:30,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:30,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:30,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:04:30,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:04:30,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:30,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:30,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:30,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1919734142, now seen corresponding path program 1 times [2025-02-06 19:04:30,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:30,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762347175] [2025-02-06 19:04:30,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:30,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:04:30,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:04:30,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:30,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:31,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:04:31,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762347175] [2025-02-06 19:04:31,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762347175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:04:31,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027525586] [2025-02-06 19:04:31,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:31,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:04:31,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:31,220 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:04:31,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-02-06 19:04:31,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:04:31,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:04:31,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:31,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:31,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:04:31,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:31,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 19:04:31,326 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-02-06 19:04:31,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 19:04:31,389 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 21 treesize of output 13 [2025-02-06 19:04:31,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 19:04:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:31,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:04:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027525586] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:04:31,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:04:31,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-02-06 19:04:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514606814] [2025-02-06 19:04:31,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:04:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:04:31,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 19:04:31,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 19:04:31,667 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:04:31,763 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-02-06 19:04:31,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2025-02-06 19:04:31,764 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:04:31,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2025-02-06 19:04:31,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:04:31,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:04:31,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:04:31,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:04:31,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:04:31,764 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:04:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:04:31,765 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:04:31,765 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:04:31,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:04:31,765 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:04:31,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:04:31,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:04:31 BoogieIcfgContainer [2025-02-06 19:04:31,775 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:04:31,776 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:04:31,776 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:04:31,776 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:04:31,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:04:20" (3/4) ... [2025-02-06 19:04:31,779 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:04:31,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:04:31,782 INFO L158 Benchmark]: Toolchain (without parser) took 12175.08ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.1MB in the beginning and 255.8MB in the end (delta: -149.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2025-02-06 19:04:31,783 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:04:31,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.61ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 89.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:04:31,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.66ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 87.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:04:31,784 INFO L158 Benchmark]: Boogie Preprocessor took 47.85ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 86.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:04:31,784 INFO L158 Benchmark]: IcfgBuilder took 479.93ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 65.1MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 19:04:31,784 INFO L158 Benchmark]: BuchiAutomizer took 11224.41ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 65.1MB in the beginning and 255.9MB in the end (delta: -190.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:04:31,784 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 302.0MB. Free memory was 255.9MB in the beginning and 255.8MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:04:31,786 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.61ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 89.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.66ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 87.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.85ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 86.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 479.93ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 65.1MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 11224.41ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 65.1MB in the beginning and 255.9MB in the end (delta: -190.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 302.0MB. Free memory was 255.9MB in the beginning and 255.8MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 10.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 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, 98 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 122 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital314 mio100 ax105 hnf100 lsp94 ukn73 mio100 lsp25 div100 bol100 ite100 ukn100 eq166 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms 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-02-06 19:04:31,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:32,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE