./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.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/Urban-2013WST-Fig2-alloca-2.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 041376d57652038a5d4ee57a004231861ab6efac51c30f8b6c72783e60a27529
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 19:04:25,734 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 19:04:25,783 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:25,788 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 19:04:25,790 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 19:04:25,790 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG
[2025-02-06 19:04:25,808 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 19:04:25,809 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 19:04:25,809 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 19:04:25,809 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-06 19:04:25,810 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-06 19:04:25,810 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 19:04:25,811 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 19:04:25,811 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 19:04:25,811 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-02-06 19:04:25,811 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-02-06 19:04:25,811 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-02-06 19:04:25,811 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-02-06 19:04:25,811 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-02-06 19:04:25,812 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 19:04:25,812 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 19:04:25,813 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 19:04:25,813 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 19:04:25,813 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 19:04:25,813 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 19:04:25,813 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-02-06 19:04:25,813 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 -> 041376d57652038a5d4ee57a004231861ab6efac51c30f8b6c72783e60a27529
[2025-02-06 19:04:26,030 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 19:04:26,038 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 19:04:26,041 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 19:04:26,041 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 19:04:26,042 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 19:04:26,043 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i
[2025-02-06 19:04:27,163 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18167d504/f97734a215354d18abc0b870a8ffed2d/FLAGcde016ec2
[2025-02-06 19:04:27,473 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 19:04:27,473 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i
[2025-02-06 19:04:27,484 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18167d504/f97734a215354d18abc0b870a8ffed2d/FLAGcde016ec2
[2025-02-06 19:04:27,736 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18167d504/f97734a215354d18abc0b870a8ffed2d
[2025-02-06 19:04:27,738 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 19:04:27,739 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 19:04:27,741 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 19:04:27,741 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 19:04:27,744 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 19:04:27,744 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:04:27" (1/1) ...
[2025-02-06 19:04:27,746 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e4cf09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:27, skipping insertion in model container
[2025-02-06 19:04:27,746 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:04:27" (1/1) ...
[2025-02-06 19:04:27,770 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 19:04:27,988 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 19:04:27,994 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 19:04:28,012 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 19:04:28,046 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 19:04:28,047 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:28 WrapperNode
[2025-02-06 19:04:28,047 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 19:04:28,047 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 19:04:28,047 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 19:04:28,047 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 19:04:28,056 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:28" (1/1) ...
[2025-02-06 19:04:28,066 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:28" (1/1) ...
[2025-02-06 19:04:28,093 INFO  L138                Inliner]: procedures = 110, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37
[2025-02-06 19:04:28,093 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 19:04:28,093 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 19:04:28,093 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 19:04:28,093 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 19:04:28,102 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:28" (1/1) ...
[2025-02-06 19:04:28,106 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:28" (1/1) ...
[2025-02-06 19:04:28,108 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:28" (1/1) ...
[2025-02-06 19:04:28,122 INFO  L175           MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [3, 2].
[2025-02-06 19:04:28,126 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:28" (1/1) ...
[2025-02-06 19:04:28,127 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:28" (1/1) ...
[2025-02-06 19:04:28,129 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:28" (1/1) ...
[2025-02-06 19:04:28,130 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:28" (1/1) ...
[2025-02-06 19:04:28,130 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:28" (1/1) ...
[2025-02-06 19:04:28,132 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:28" (1/1) ...
[2025-02-06 19:04:28,133 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 19:04:28,136 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 19:04:28,136 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 19:04:28,136 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 19:04:28,137 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:28" (1/1) ...
[2025-02-06 19:04:28,145 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:28,165 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:28,186 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:28,195 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:28,218 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-02-06 19:04:28,218 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-02-06 19:04:28,218 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-02-06 19:04:28,218 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-02-06 19:04:28,218 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-02-06 19:04:28,218 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-02-06 19:04:28,218 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 19:04:28,218 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 19:04:28,296 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 19:04:28,297 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 19:04:28,382 INFO  L?                        ?]: Removed 4 outVars from TransFormulas that were not future-live.
[2025-02-06 19:04:28,382 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 19:04:28,392 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 19:04:28,393 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 19:04:28,393 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:04:28 BoogieIcfgContainer
[2025-02-06 19:04:28,393 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 19:04:28,394 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-02-06 19:04:28,394 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-02-06 19:04:28,398 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-02-06 19:04:28,398 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-06 19:04:28,399 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:04:27" (1/3) ...
[2025-02-06 19:04:28,399 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216153d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:04:28, skipping insertion in model container
[2025-02-06 19:04:28,399 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-06 19:04:28,399 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:28" (2/3) ...
[2025-02-06 19:04:28,400 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216153d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:04:28, skipping insertion in model container
[2025-02-06 19:04:28,400 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-06 19:04:28,400 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:04:28" (3/3) ...
[2025-02-06 19:04:28,401 INFO  L363   chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca-2.i
[2025-02-06 19:04:28,453 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-02-06 19:04:28,453 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-02-06 19:04:28,454 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-02-06 19:04:28,454 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-02-06 19:04:28,454 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-02-06 19:04:28,455 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-02-06 19:04:28,455 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-02-06 19:04:28,455 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-02-06 19:04:28,463 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:28,480 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:04:28,480 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:04:28,482 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:04:28,485 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:04:28,485 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2025-02-06 19:04:28,485 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-02-06 19:04:28,485 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:28,487 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:04:28,487 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:04:28,487 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:04:28,488 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:04:28,488 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2025-02-06 19:04:28,492 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1;" 
[2025-02-06 19:04:28,493 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume main_#t~mem6#1 <= 10;havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !true;" "call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1;" 
[2025-02-06 19:04:28,503 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:28,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 1 times
[2025-02-06 19:04:28,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:28,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576168631]
[2025-02-06 19:04:28,513 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:04:28,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:28,607 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:28,642 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:28,642 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:28,642 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:28,643 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:28,651 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:28,663 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:28,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:28,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:28,679 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:28,685 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:28,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 1322586, now seen corresponding path program 1 times
[2025-02-06 19:04:28,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:28,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742431288]
[2025-02-06 19:04:28,685 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:04:28,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:28,696 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-06 19:04:28,706 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-06 19:04:28,706 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:28,706 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:28,765 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:28,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:04:28,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742431288]
[2025-02-06 19:04:28,767 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742431288] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 19:04:28,768 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 19:04:28,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 19:04:28,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147364711]
[2025-02-06 19:04:28,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 19:04:28,776 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:04:28,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:04:28,808 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-06 19:04:28,813 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-06 19:04:28,814 INFO  L87              Difference]: Start difference. First operand  has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:28,817 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:04:28,821 INFO  L93              Difference]: Finished difference Result 11 states and 12 transitions.
[2025-02-06 19:04:28,822 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions.
[2025-02-06 19:04:28,823 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:04:28,831 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions.
[2025-02-06 19:04:28,831 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 7
[2025-02-06 19:04:28,832 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 7
[2025-02-06 19:04:28,832 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions.
[2025-02-06 19:04:28,836 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:04:28,836 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions.
[2025-02-06 19:04:28,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions.
[2025-02-06 19:04:28,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7.
[2025-02-06 19:04:28,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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:28,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions.
[2025-02-06 19:04:28,853 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions.
[2025-02-06 19:04:28,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-06 19:04:28,862 INFO  L432   stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions.
[2025-02-06 19:04:28,862 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-02-06 19:04:28,862 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions.
[2025-02-06 19:04:28,863 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:04:28,864 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:04:28,864 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:04:28,864 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:04:28,864 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1]
[2025-02-06 19:04:28,864 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1;" 
[2025-02-06 19:04:28,864 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume main_#t~mem6#1 <= 10;havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;" "call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1;" 
[2025-02-06 19:04:28,866 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:28,866 INFO  L85        PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 2 times
[2025-02-06 19:04:28,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:28,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725233816]
[2025-02-06 19:04:28,866 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:04:28,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:28,880 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:28,902 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:28,903 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 19:04:28,904 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:28,904 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:28,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:28,922 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:28,927 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:28,927 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:28,928 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:28,932 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:28,932 INFO  L85        PathProgramCache]: Analyzing trace with hash 40999300, now seen corresponding path program 1 times
[2025-02-06 19:04:28,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:28,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380050397]
[2025-02-06 19:04:28,932 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:04:28,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:28,943 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-02-06 19:04:28,947 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-02-06 19:04:28,951 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:28,951 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:29,104 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:29,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:04:29,104 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380050397]
[2025-02-06 19:04:29,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380050397] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 19:04:29,104 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 19:04:29,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-06 19:04:29,104 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420238839]
[2025-02-06 19:04:29,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 19:04:29,104 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:04:29,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:04:29,105 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-06 19:04:29,105 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-06 19:04:29,105 INFO  L87              Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand  has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:29,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:04:29,130 INFO  L93              Difference]: Finished difference Result 9 states and 10 transitions.
[2025-02-06 19:04:29,130 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions.
[2025-02-06 19:04:29,130 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-06 19:04:29,130 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions.
[2025-02-06 19:04:29,130 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 9
[2025-02-06 19:04:29,130 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 9
[2025-02-06 19:04:29,131 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions.
[2025-02-06 19:04:29,131 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:04:29,131 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions.
[2025-02-06 19:04:29,131 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions.
[2025-02-06 19:04:29,131 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2025-02-06 19:04:29,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:29,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions.
[2025-02-06 19:04:29,132 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions.
[2025-02-06 19:04:29,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-06 19:04:29,132 INFO  L432   stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions.
[2025-02-06 19:04:29,133 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-02-06 19:04:29,133 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions.
[2025-02-06 19:04:29,133 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-02-06 19:04:29,133 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:04:29,133 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:04:29,133 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:04:29,133 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1]
[2025-02-06 19:04:29,133 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1;" 
[2025-02-06 19:04:29,134 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume main_#t~mem6#1 <= 10;havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;" "call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1;" 
[2025-02-06 19:04:29,134 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:29,134 INFO  L85        PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 3 times
[2025-02-06 19:04:29,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:29,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123915436]
[2025-02-06 19:04:29,135 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:04:29,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:29,144 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:29,157 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:29,157 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-06 19:04:29,157 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:29,158 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:29,161 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:29,169 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:29,169 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:29,169 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:29,171 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:29,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:29,176 INFO  L85        PathProgramCache]: Analyzing trace with hash 745656389, now seen corresponding path program 1 times
[2025-02-06 19:04:29,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:29,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409503985]
[2025-02-06 19:04:29,176 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:04:29,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:29,185 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-06 19:04:29,189 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-06 19:04:29,190 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:29,190 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:29,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:04:29,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:04:29,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409503985]
[2025-02-06 19:04:29,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409503985] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:04:29,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787925510]
[2025-02-06 19:04:29,365 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:04:29,365 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:04:29,365 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:29,372 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:04:29,373 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-06 19:04:29,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-02-06 19:04:29,433 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-02-06 19:04:29,433 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:29,433 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:29,435 INFO  L256         TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:29,437 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:29,466 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:29,484 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 19 treesize of output 11
[2025-02-06 19:04:29,502 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:04:29,502 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:04:29,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:04:29,539 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [787925510] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:04:29,539 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:04:29,539 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10
[2025-02-06 19:04:29,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560144153]
[2025-02-06 19:04:29,539 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:04:29,539 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:04:29,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:04:29,540 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-06 19:04:29,540 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2025-02-06 19:04:29,540 INFO  L87              Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand  has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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:29,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:04:29,586 INFO  L93              Difference]: Finished difference Result 15 states and 16 transitions.
[2025-02-06 19:04:29,586 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions.
[2025-02-06 19:04:29,587 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 13
[2025-02-06 19:04:29,587 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions.
[2025-02-06 19:04:29,587 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 15
[2025-02-06 19:04:29,587 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 15
[2025-02-06 19:04:29,587 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions.
[2025-02-06 19:04:29,588 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:04:29,588 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-02-06 19:04:29,588 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions.
[2025-02-06 19:04:29,588 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2025-02-06 19:04:29,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:29,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions.
[2025-02-06 19:04:29,589 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-02-06 19:04:29,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-06 19:04:29,589 INFO  L432   stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-02-06 19:04:29,590 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-02-06 19:04:29,590 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions.
[2025-02-06 19:04:29,590 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 13
[2025-02-06 19:04:29,590 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:04:29,590 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:04:29,590 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:04:29,590 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1]
[2025-02-06 19:04:29,590 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1;" 
[2025-02-06 19:04:29,590 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume main_#t~mem6#1 <= 10;havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;" "call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1;" 
[2025-02-06 19:04:29,591 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:29,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 4 times
[2025-02-06 19:04:29,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:29,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222854282]
[2025-02-06 19:04:29,591 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-06 19:04:29,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:29,596 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes.
[2025-02-06 19:04:29,601 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:29,601 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-06 19:04:29,601 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:29,601 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:29,602 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:29,604 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:29,604 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:29,604 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:29,606 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:29,606 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:29,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 551987976, now seen corresponding path program 2 times
[2025-02-06 19:04:29,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:29,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899517793]
[2025-02-06 19:04:29,606 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:04:29,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:29,612 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes.
[2025-02-06 19:04:29,616 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-06 19:04:29,617 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:04:29,617 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:29,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:04:29,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:04:29,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899517793]
[2025-02-06 19:04:29,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899517793] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:04:29,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178225555]
[2025-02-06 19:04:29,986 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:04:29,986 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:04:29,986 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:29,988 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:04:29,990 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-06 19:04:30,023 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes.
[2025-02-06 19:04:30,035 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-06 19:04:30,035 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:04:30,035 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:30,036 INFO  L256         TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:30,037 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:30,040 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:30,061 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 19 treesize of output 11
[2025-02-06 19:04:30,108 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 19 treesize of output 11
[2025-02-06 19:04:30,129 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 19 treesize of output 11
[2025-02-06 19:04:30,143 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 19 treesize of output 11
[2025-02-06 19:04:30,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:04:30,156 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:04:30,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:04:30,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178225555] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:04:30,225 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:04:30,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20
[2025-02-06 19:04:30,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328981961]
[2025-02-06 19:04:30,225 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:04:30,225 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:04:30,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:04:30,225 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-02-06 19:04:30,226 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380
[2025-02-06 19:04:30,226 INFO  L87              Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand  has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:30,351 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:04:30,351 INFO  L93              Difference]: Finished difference Result 25 states and 26 transitions.
[2025-02-06 19:04:30,351 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions.
[2025-02-06 19:04:30,352 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2025-02-06 19:04:30,352 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions.
[2025-02-06 19:04:30,352 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 25
[2025-02-06 19:04:30,352 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 25
[2025-02-06 19:04:30,353 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions.
[2025-02-06 19:04:30,353 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:04:30,353 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions.
[2025-02-06 19:04:30,353 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions.
[2025-02-06 19:04:30,354 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2025-02-06 19:04:30,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:30,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions.
[2025-02-06 19:04:30,354 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions.
[2025-02-06 19:04:30,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-06 19:04:30,355 INFO  L432   stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions.
[2025-02-06 19:04:30,355 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-02-06 19:04:30,355 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions.
[2025-02-06 19:04:30,355 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2025-02-06 19:04:30,355 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:04:30,355 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:04:30,356 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-02-06 19:04:30,356 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1]
[2025-02-06 19:04:30,356 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1;" 
[2025-02-06 19:04:30,356 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume main_#t~mem6#1 <= 10;havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;" "call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1;" 
[2025-02-06 19:04:30,356 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:30,356 INFO  L85        PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 5 times
[2025-02-06 19:04:30,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:30,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494232325]
[2025-02-06 19:04:30,357 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-06 19:04:30,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:30,362 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:30,364 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:30,365 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 19:04:30,365 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:30,365 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:30,366 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:30,367 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:30,367 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:30,368 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:30,369 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:30,369 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:30,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -941060787, now seen corresponding path program 3 times
[2025-02-06 19:04:30,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:30,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120131541]
[2025-02-06 19:04:30,370 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:04:30,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:30,377 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 10 equivalence classes.
[2025-02-06 19:04:30,392 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 23 of 23 statements.
[2025-02-06 19:04:30,393 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s)
[2025-02-06 19:04:30,393 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:30,393 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:30,395 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-02-06 19:04:30,400 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-02-06 19:04:30,401 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:30,401 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:30,404 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:30,404 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:30,404 INFO  L85        PathProgramCache]: Analyzing trace with hash -723746642, now seen corresponding path program 1 times
[2025-02-06 19:04:30,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:30,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430389502]
[2025-02-06 19:04:30,404 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:04:30,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:30,413 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-02-06 19:04:30,422 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-02-06 19:04:30,422 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:30,422 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:30,422 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:30,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-02-06 19:04:30,430 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-02-06 19:04:30,431 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:30,431 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:30,434 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:32,304 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:04:32,305 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:04:32,305 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:04:32,305 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:04:32,305 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:04:32,305 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:32,305 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:04:32,305 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:04:32,306 INFO  L132   ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration5_Lasso
[2025-02-06 19:04:32,306 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:04:32,306 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:04:32,316 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,320 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,322 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,324 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,326 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,328 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,329 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,330 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,484 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,486 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,488 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:32,796 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:04:32,800 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:04:32,801 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:32,801 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:32,826 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:32,830 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:32,831 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:32,842 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:32,842 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:04:32,843 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:32,843 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:32,843 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:32,846 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:04:32,846 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:04:32,847 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:32,853 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:32,854 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:32,854 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:32,855 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:32,857 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:32,858 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:32,868 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:32,868 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:04:32,868 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:32,868 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:32,868 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:32,869 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:04:32,869 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:04:32,870 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:32,875 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:32,876 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:32,876 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:32,878 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:32,880 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:32,880 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:04:32,890 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:32,891 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:32,891 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:32,891 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:32,896 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:32,896 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:32,898 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:32,907 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:32,908 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:32,908 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:32,913 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:32,915 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:32,915 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:04:32,936 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:32,936 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:04:32,936 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:32,936 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:32,936 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:32,937 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:04:32,937 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:04:32,939 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:32,949 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:32,949 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:32,950 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:32,952 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:32,952 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:32,954 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:32,963 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:32,964 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:32,964 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:32,964 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:32,965 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:32,965 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:32,968 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:32,976 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:32,976 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:32,976 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:32,978 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:32,980 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:32,980 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:32,990 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:32,990 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:04:32,990 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:32,990 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:32,990 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:32,992 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:04:32,992 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:04:32,995 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:33,001 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:33,001 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:33,001 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:33,003 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:33,004 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:33,006 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:33,018 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:33,018 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:04:33,018 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:33,018 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:33,018 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:33,020 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:04:33,020 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:04:33,021 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:33,027 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:33,027 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:33,027 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:33,029 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:33,030 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:04:33,032 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:33,040 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:33,040 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:33,040 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:33,040 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:33,043 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:33,043 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:33,047 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:33,053 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2025-02-06 19:04:33,053 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:33,053 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:33,061 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:33,062 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:33,062 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:04:33,072 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:33,072 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:33,073 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:33,073 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:33,077 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:33,077 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:33,081 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:33,088 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:33,088 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:33,088 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:33,094 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:33,096 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:33,097 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:33,106 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:33,107 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:33,107 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:33,107 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:33,111 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:33,112 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:33,116 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:33,123 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:33,124 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:33,124 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:33,125 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:33,133 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:33,134 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:33,144 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:33,144 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:33,144 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:33,144 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:33,146 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:33,146 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:33,148 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:33,154 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:33,154 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:33,154 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:33,156 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:33,157 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:33,158 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:33,168 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:33,168 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:33,168 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:33,168 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:33,172 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:33,172 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:33,175 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:33,180 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:33,181 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:33,181 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:33,184 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:33,185 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:33,186 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:33,196 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:33,196 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:04:33,196 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:33,196 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:33,196 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:33,200 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:04:33,200 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:04:33,203 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:04:33,211 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2025-02-06 19:04:33,212 INFO  L444   ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2025-02-06 19:04:33,214 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:33,215 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:33,218 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:33,219 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:33,219 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:04:33,220 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2025-02-06 19:04:33,220 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:04:33,220 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1 + 21
Supporting invariants []
[2025-02-06 19:04:33,226 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:33,246 INFO  L156   tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed
[2025-02-06 19:04:33,250 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1
[2025-02-06 19:04:33,251 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
[2025-02-06 19:04:33,251 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x1~0!base,<LOCAL,main>]]]
[2025-02-06 19:04:33,260 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:33,266 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:33,270 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:33,270 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:33,270 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:33,271 INFO  L256         TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:33,271 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:33,283 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-02-06 19:04:33,299 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-02-06 19:04:33,299 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:33,299 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:33,299 INFO  L256         TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:33,300 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:33,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-02-06 19:04:33,411 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 
[2025-02-06 19:04:33,412 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:33,446 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 48 states and 51 transitions. Complement of second has 6 states.
[2025-02-06 19:04:33,448 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:04:33,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:33,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions.
[2025-02-06 19:04:33,450 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters.
[2025-02-06 19:04:33,451 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:33,451 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters.
[2025-02-06 19:04:33,451 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:33,451 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters.
[2025-02-06 19:04:33,452 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:33,456 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions.
[2025-02-06 19:04:33,457 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-06 19:04:33,458 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions.
[2025-02-06 19:04:33,458 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 23
[2025-02-06 19:04:33,458 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 24
[2025-02-06 19:04:33,458 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions.
[2025-02-06 19:04:33,458 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-06 19:04:33,458 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 47 states and 50 transitions.
[2025-02-06 19:04:33,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions.
[2025-02-06 19:04:33,459 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29.
[2025-02-06 19:04:33,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:33,460 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions.
[2025-02-06 19:04:33,460 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions.
[2025-02-06 19:04:33,460 INFO  L432   stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions.
[2025-02-06 19:04:33,460 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2025-02-06 19:04:33,460 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions.
[2025-02-06 19:04:33,460 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-06 19:04:33,463 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:04:33,463 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:04:33,463 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2025-02-06 19:04:33,463 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2025-02-06 19:04:33,463 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume main_#t~mem6#1 <= 10;havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" 
[2025-02-06 19:04:33,463 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" 
[2025-02-06 19:04:33,464 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:33,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 1415007, now seen corresponding path program 1 times
[2025-02-06 19:04:33,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:33,464 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446627621]
[2025-02-06 19:04:33,464 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:04:33,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:33,472 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-06 19:04:33,479 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-06 19:04:33,479 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:33,479 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:33,479 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:33,480 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-06 19:04:33,482 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-06 19:04:33,482 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:33,482 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:33,485 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:33,488 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:33,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times
[2025-02-06 19:04:33,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:33,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929814354]
[2025-02-06 19:04:33,488 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:04:33,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:33,491 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:33,492 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:33,495 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:33,495 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:33,496 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:33,496 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:33,497 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:33,497 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:33,497 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:33,498 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:33,499 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:33,499 INFO  L85        PathProgramCache]: Analyzing trace with hash 1359821950, now seen corresponding path program 1 times
[2025-02-06 19:04:33,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:33,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480044902]
[2025-02-06 19:04:33,502 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:04:33,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:33,507 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-02-06 19:04:33,509 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-02-06 19:04:33,512 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:33,512 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:33,513 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:33,514 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-02-06 19:04:33,520 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-02-06 19:04:33,520 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:33,520 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:33,522 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:33,818 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:34,045 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:04:34,048 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:04:34,048 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:04:34,048 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:04:34,048 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:04:34,048 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:34,048 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:04:34,049 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:04:34,049 INFO  L132   ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration6_Lasso
[2025-02-06 19:04:34,049 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:04:34,049 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:04:34,050 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,194 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,196 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,197 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,199 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,200 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,202 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,207 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,210 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,212 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,213 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,216 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:34,361 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:04:34,363 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:04:34,363 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:34,363 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:34,369 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:34,373 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:34,377 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:34,394 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:34,394 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:34,394 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:34,394 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:34,399 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:34,399 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:34,401 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:34,409 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:34,409 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:34,409 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:34,412 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:34,413 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:34,414 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:34,425 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:34,425 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:34,425 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:34,425 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:34,430 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:34,430 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:34,433 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:34,438 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:34,439 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:34,439 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:34,441 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:34,441 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:34,442 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:34,452 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:34,452 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:34,452 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:34,452 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:34,457 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:34,457 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:34,460 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:34,472 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:34,473 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:34,473 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:34,474 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:34,476 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:34,477 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:34,487 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:34,487 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:34,487 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:34,487 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:34,491 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:34,491 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:34,496 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:04:34,501 INFO  L443   ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2025-02-06 19:04:34,501 INFO  L444   ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero.
[2025-02-06 19:04:34,502 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:34,502 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:34,505 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:34,506 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:34,507 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:04:34,521 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-06 19:04:34,521 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:04:34,522 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2
Supporting invariants []
[2025-02-06 19:04:34,531 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:34,539 INFO  L156   tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed
[2025-02-06 19:04:34,540 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0
[2025-02-06 19:04:34,540 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
[2025-02-06 19:04:34,540 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,<LOCAL,main>]]]
[2025-02-06 19:04:34,552 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:34,557 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-02-06 19:04:34,563 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-02-06 19:04:34,563 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:34,563 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:34,564 INFO  L256         TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:34,564 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:34,571 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:34,573 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:34,573 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:34,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:34,573 INFO  L256         TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:34,574 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:34,583 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:34,584 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2025-02-06 19:04:34,584 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand  has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:34,600 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5. Second operand  has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 73 states and 79 transitions. Complement of second has 7 states.
[2025-02-06 19:04:34,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:04:34,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:34,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions.
[2025-02-06 19:04:34,602 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters.
[2025-02-06 19:04:34,602 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:34,602 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters.
[2025-02-06 19:04:34,602 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:34,602 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters.
[2025-02-06 19:04:34,603 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:34,603 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions.
[2025-02-06 19:04:34,603 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-06 19:04:34,604 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 55 states and 59 transitions.
[2025-02-06 19:04:34,604 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 7
[2025-02-06 19:04:34,604 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 7
[2025-02-06 19:04:34,604 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions.
[2025-02-06 19:04:34,604 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-06 19:04:34,604 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 55 states and 59 transitions.
[2025-02-06 19:04:34,604 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions.
[2025-02-06 19:04:34,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50.
[2025-02-06 19:04:34,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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:34,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions.
[2025-02-06 19:04:34,610 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 50 states and 53 transitions.
[2025-02-06 19:04:34,610 INFO  L432   stractBuchiCegarLoop]: Abstraction has 50 states and 53 transitions.
[2025-02-06 19:04:34,610 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2025-02-06 19:04:34,610 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions.
[2025-02-06 19:04:34,611 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-02-06 19:04:34,611 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:04:34,611 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:04:34,611 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1]
[2025-02-06 19:04:34,613 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2025-02-06 19:04:34,613 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume main_#t~mem6#1 <= 10;havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;" "call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume main_#t~mem6#1 <= 10;havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" 
[2025-02-06 19:04:34,613 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume main_#t~mem7#1 > 1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1;" 
[2025-02-06 19:04:34,613 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:34,613 INFO  L85        PathProgramCache]: Analyzing trace with hash 264179405, now seen corresponding path program 2 times
[2025-02-06 19:04:34,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:34,614 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176633695]
[2025-02-06 19:04:34,614 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:04:34,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:34,621 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes.
[2025-02-06 19:04:34,632 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-06 19:04:34,633 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:04:34,633 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:34,633 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:34,635 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-02-06 19:04:34,641 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-06 19:04:34,641 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:34,641 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:34,669 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:34,669 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:34,669 INFO  L85        PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 2 times
[2025-02-06 19:04:34,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:34,674 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072792980]
[2025-02-06 19:04:34,674 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:04:34,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:34,677 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:34,678 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:34,679 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 19:04:34,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:34,679 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:34,679 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:34,679 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:34,680 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:34,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:34,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:34,681 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:34,681 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:34,681 INFO  L85        PathProgramCache]: Analyzing trace with hash 473337964, now seen corresponding path program 3 times
[2025-02-06 19:04:34,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:04:34,682 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830623327]
[2025-02-06 19:04:34,682 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:04:34,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:04:34,689 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 11 equivalence classes.
[2025-02-06 19:04:34,712 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 29 of 29 statements.
[2025-02-06 19:04:34,712 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2025-02-06 19:04:34,712 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:34,712 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:04:34,715 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-02-06 19:04:34,720 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-02-06 19:04:34,720 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:34,720 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:04:34,724 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:04:40,766 WARN  L286               SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 189 DAG size of output: 165 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2025-02-06 19:04:40,865 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:04:40,865 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:04:40,865 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:04:40,865 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:04:40,865 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:04:40,865 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:40,866 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:04:40,866 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:04:40,866 INFO  L132   ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration7_Lasso
[2025-02-06 19:04:40,866 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:04:40,866 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:04:40,869 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,871 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,968 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,970 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,971 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,973 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,976 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,978 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,980 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,982 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,983 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:40,984 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:04:41,122 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:04:41,122 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:04:41,122 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:41,122 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:41,124 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:41,125 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:41,129 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:04:41,140 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:41,140 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:04:41,140 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:41,140 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:41,140 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:41,140 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:04:41,140 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:04:41,142 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:04:41,147 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:41,147 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:41,147 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:41,149 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:41,150 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:41,151 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:41,161 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:04:41,161 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:04:41,161 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:04:41,161 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:04:41,163 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:04:41,163 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:04:41,167 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:04:41,176 INFO  L443   ModelExtractionUtils]: Simplification made 5 calls to the SMT solver.
[2025-02-06 19:04:41,176 INFO  L444   ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 5 variables to zero.
[2025-02-06 19:04:41,176 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:04:41,176 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:04:41,178 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:41,179 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:41,180 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:04:41,191 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-06 19:04:41,191 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:04:41,191 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3
Supporting invariants []
[2025-02-06 19:04:41,197 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:41,206 INFO  L156   tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed
[2025-02-06 19:04:41,207 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0
[2025-02-06 19:04:41,208 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
[2025-02-06 19:04:41,208 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,<LOCAL,main>]]]
[2025-02-06 19:04:41,216 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:41,227 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-02-06 19:04:41,246 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-06 19:04:41,246 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:41,246 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:41,247 INFO  L256         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:41,248 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:41,273 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:41,275 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:41,275 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:41,275 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:41,276 INFO  L256         TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:41,276 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:41,286 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:41,286 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2025-02-06 19:04:41,286 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:41,302 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 73 transitions. Complement of second has 7 states.
[2025-02-06 19:04:41,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:04:41,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:41,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions.
[2025-02-06 19:04:41,304 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters.
[2025-02-06 19:04:41,304 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:41,304 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-02-06 19:04:41,312 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:41,327 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-02-06 19:04:41,351 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-06 19:04:41,351 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:41,351 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:41,352 INFO  L256         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:41,353 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:41,380 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:41,382 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:41,382 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:41,382 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:41,383 INFO  L256         TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:41,383 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:41,393 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:41,393 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates 
[2025-02-06 19:04:41,394 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:41,411 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 73 transitions. Complement of second has 7 states.
[2025-02-06 19:04:41,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:04:41,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:41,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions.
[2025-02-06 19:04:41,414 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters.
[2025-02-06 19:04:41,414 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:41,415 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-02-06 19:04:41,423 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:04:41,435 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-02-06 19:04:41,455 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-02-06 19:04:41,455 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:41,455 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:41,456 INFO  L256         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:41,457 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:41,483 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-02-06 19:04:41,485 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-02-06 19:04:41,485 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:04:41,485 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:04:41,485 INFO  L256         TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-06 19:04:41,487 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:04:41,497 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:41,497 INFO  L141   lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2025-02-06 19:04:41,498 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:41,512 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 82 transitions. Complement of second has 6 states.
[2025-02-06 19:04:41,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:04:41,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:04:41,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions.
[2025-02-06 19:04:41,513 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 27 letters. Loop has 2 letters.
[2025-02-06 19:04:41,513 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:41,513 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 29 letters. Loop has 2 letters.
[2025-02-06 19:04:41,514 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:41,514 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 27 letters. Loop has 4 letters.
[2025-02-06 19:04:41,514 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:04:41,514 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions.
[2025-02-06 19:04:41,516 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-02-06 19:04:41,516 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions.
[2025-02-06 19:04:41,516 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2025-02-06 19:04:41,516 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2025-02-06 19:04:41,516 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2025-02-06 19:04:41,516 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:04:41,516 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-06 19:04:41,516 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-06 19:04:41,516 INFO  L432   stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-06 19:04:41,516 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 8 ============
[2025-02-06 19:04:41,516 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2025-02-06 19:04:41,517 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-02-06 19:04:41,517 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2025-02-06 19:04:41,526 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:04:41 BoogieIcfgContainer
[2025-02-06 19:04:41,529 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2025-02-06 19:04:41,530 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-06 19:04:41,530 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-06 19:04:41,530 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-06 19:04:41,530 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:28" (3/4) ...
[2025-02-06 19:04:41,534 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-02-06 19:04:41,534 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-06 19:04:41,535 INFO  L158              Benchmark]: Toolchain (without parser) took 13795.81ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 104.3MB in the beginning and 146.5MB in the end (delta: -42.2MB). Peak memory consumption was 153.5MB. Max. memory is 16.1GB.
[2025-02-06 19:04:41,535 INFO  L158              Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:04:41,535 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 306.16ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 88.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-06 19:04:41,535 INFO  L158              Benchmark]: Boogie Procedure Inliner took 45.65ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 86.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:04:41,535 INFO  L158              Benchmark]: Boogie Preprocessor took 42.00ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 85.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:04:41,535 INFO  L158              Benchmark]: IcfgBuilder took 257.30ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 74.2MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-06 19:04:41,535 INFO  L158              Benchmark]: BuchiAutomizer took 13135.38ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 74.2MB in the beginning and 146.5MB in the end (delta: -72.3MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB.
[2025-02-06 19:04:41,535 INFO  L158              Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 335.5MB. Free memory was 146.5MB in the beginning and 146.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:04:41,536 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.27ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 306.16ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 88.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 45.65ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 86.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 42.00ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 85.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 257.30ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 74.2MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 13135.38ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 74.2MB in the beginning and 146.5MB in the end (delta: -72.3MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB.
 * Witness Printer took 4.36ms. Allocated memory is still 335.5MB. Free memory was 146.5MB in the beginning and 146.5MB in the end (delta: 41.6kB). 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#1
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x1~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#0
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#0
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,<LOCAL,main>]]]
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 20 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 13.0s and 8 iterations.  TraceHistogramMax:10. Analysis of lassos took 12.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1.	Nontrivial modules had stage [2, 0, 1, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 90/90	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 139 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 163 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 63 mSDtfsCounter, 163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks:   Lassos: inital149 mio100 ax112 hnf100 lsp87 ukn62 mio100 lsp26 div100 bol100 ite100 ukn100 eq163 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.0s
  - TerminationAnalysisResult: Termination proven
    Buchi Automizer proved that your program is terminating
RESULT: Ultimate proved your program to be correct!
[2025-02-06 19:04:41,562 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:41,755 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-06 19:04:41,959 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-06 19:04:42,161 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE