./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-04 15:40:35,058 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-04 15:40:35,114 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf
[2025-03-04 15:40:35,122 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-04 15:40:35,123 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-04 15:40:35,123 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG
[2025-03-04 15:40:35,146 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-04 15:40:35,147 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-04 15:40:35,147 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-04 15:40:35,148 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-04 15:40:35,148 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-04 15:40:35,148 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-04 15:40:35,149 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-04 15:40:35,149 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-04 15:40:35,149 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-03-04 15:40:35,149 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-03-04 15:40:35,149 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-03-04 15:40:35,149 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-03-04 15:40:35,149 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-03-04 15:40:35,149 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-03-04 15:40:35,150 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-04 15:40:35,150 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-04 15:40:35,151 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-04 15:40:35,151 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-04 15:40:35,151 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-04 15:40:35,151 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-04 15:40:35,152 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-03-04 15:40:35,152 INFO  L153        SettingsManager]:  * TransformationType=MODULO_NEIGHBOR
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1
[2025-03-04 15:40:35,389 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-04 15:40:35,395 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-04 15:40:35,397 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-04 15:40:35,398 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-04 15:40:35,398 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-04 15:40:35,400 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i
[2025-03-04 15:40:36,564 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68065d087/33973f32a12c4146b6e0fb6ccc166f6d/FLAG5e4984c5b
[2025-03-04 15:40:36,829 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-04 15:40:36,830 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i
[2025-03-04 15:40:36,838 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68065d087/33973f32a12c4146b6e0fb6ccc166f6d/FLAG5e4984c5b
[2025-03-04 15:40:37,137 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68065d087/33973f32a12c4146b6e0fb6ccc166f6d
[2025-03-04 15:40:37,140 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-04 15:40:37,141 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-04 15:40:37,141 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-04 15:40:37,141 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-04 15:40:37,145 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-04 15:40:37,145 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,146 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339da571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37, skipping insertion in model container
[2025-03-04 15:40:37,146 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,181 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-04 15:40:37,383 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-04 15:40:37,390 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-04 15:40:37,422 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-04 15:40:37,441 INFO  L204         MainTranslator]: Completed translation
[2025-03-04 15:40:37,442 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37 WrapperNode
[2025-03-04 15:40:37,442 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-04 15:40:37,443 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-04 15:40:37,443 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-04 15:40:37,443 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-04 15:40:37,448 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,459 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,472 INFO  L138                Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56
[2025-03-04 15:40:37,474 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-04 15:40:37,474 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-04 15:40:37,475 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-04 15:40:37,475 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-04 15:40:37,480 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,480 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,485 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,499 INFO  L175           MemorySlicer]: Split 14 memory accesses to 3 slices as follows [4, 4, 6]. 43 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [2, 2, 3].
[2025-03-04 15:40:37,500 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,501 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,503 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,506 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,507 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,508 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,509 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-04 15:40:37,510 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-04 15:40:37,510 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-04 15:40:37,510 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-04 15:40:37,511 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (1/1) ...
[2025-03-04 15:40:37,516 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:37,526 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:37,538 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:37,541 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2025-03-04 15:40:37,558 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-03-04 15:40:37,559 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-03-04 15:40:37,559 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-03-04 15:40:37,559 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-03-04 15:40:37,559 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-03-04 15:40:37,559 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-03-04 15:40:37,559 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-03-04 15:40:37,559 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-03-04 15:40:37,559 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-04 15:40:37,559 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-04 15:40:37,635 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-04 15:40:37,637 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-04 15:40:37,728 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L558: havoc main_#t~mem12#1;call ULTIMATE.dealloc(main_#t~malloc2#1.base, main_#t~malloc2#1.offset);havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call ULTIMATE.dealloc(main_#t~malloc4#1.base, main_#t~malloc4#1.offset);havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset;
[2025-03-04 15:40:37,735 INFO  L?                        ?]: Removed 7 outVars from TransFormulas that were not future-live.
[2025-03-04 15:40:37,735 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-04 15:40:37,741 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-04 15:40:37,741 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-04 15:40:37,742 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:40:37 BoogieIcfgContainer
[2025-03-04 15:40:37,742 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-04 15:40:37,742 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-03-04 15:40:37,742 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-03-04 15:40:37,747 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-03-04 15:40:37,748 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-03-04 15:40:37,748 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:40:37" (1/3) ...
[2025-03-04 15:40:37,749 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@325f5f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:40:37, skipping insertion in model container
[2025-03-04 15:40:37,749 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-03-04 15:40:37,749 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:37" (2/3) ...
[2025-03-04 15:40:37,750 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@325f5f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:40:37, skipping insertion in model container
[2025-03-04 15:40:37,750 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-03-04 15:40:37,750 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:40:37" (3/3) ...
[2025-03-04 15:40:37,751 INFO  L363   chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i
[2025-03-04 15:40:37,790 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-03-04 15:40:37,790 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-03-04 15:40:37,790 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-03-04 15:40:37,790 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-03-04 15:40:37,790 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-03-04 15:40:37,791 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-03-04 15:40:37,791 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-03-04 15:40:37,791 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-03-04 15:40:37,794 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-03-04 15:40:37,808 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-03-04 15:40:37,809 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-03-04 15:40:37,809 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-03-04 15:40:37,814 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-03-04 15:40:37,814 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2025-03-04 15:40:37,814 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-03-04 15:40:37,814 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-03-04 15:40:37,815 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-03-04 15:40:37,815 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-03-04 15:40:37,815 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-03-04 15:40:37,815 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-03-04 15:40:37,815 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2025-03-04 15:40:37,819 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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" 
[2025-03-04 15:40:37,819 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !true;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" 
[2025-03-04 15:40:37,823 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:37,823 INFO  L85        PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 1 times
[2025-03-04 15:40:37,829 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:37,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382298297]
[2025-03-04 15:40:37,830 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-04 15:40:37,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:37,901 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:37,932 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:37,932 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:37,932 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:37,932 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:40:37,938 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:37,952 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:37,954 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:37,954 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:37,968 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:40:37,970 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:37,970 INFO  L85        PathProgramCache]: Analyzing trace with hash 1384154, now seen corresponding path program 1 times
[2025-03-04 15:40:37,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:37,970 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088003321]
[2025-03-04 15:40:37,970 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-04 15:40:37,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:37,979 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-03-04 15:40:37,983 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-03-04 15:40:37,985 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:37,986 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:40:38,018 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:40:38,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-04 15:40:38,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088003321]
[2025-03-04 15:40:38,019 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088003321] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-04 15:40:38,019 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-04 15:40:38,023 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-04 15:40:38,023 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991622842]
[2025-03-04 15:40:38,023 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-04 15:40:38,028 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-03-04 15:40:38,028 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-04 15:40:38,048 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-04 15:40:38,048 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-04 15:40:38,049 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-03-04 15:40:38,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-04 15:40:38,054 INFO  L93              Difference]: Finished difference Result 11 states and 12 transitions.
[2025-03-04 15:40:38,054 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions.
[2025-03-04 15:40:38,055 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-03-04 15:40:38,060 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions.
[2025-03-04 15:40:38,061 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 7
[2025-03-04 15:40:38,062 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 7
[2025-03-04 15:40:38,062 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions.
[2025-03-04 15:40:38,062 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-03-04 15:40:38,063 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions.
[2025-03-04 15:40:38,070 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions.
[2025-03-04 15:40:38,076 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7.
[2025-03-04 15:40:38,078 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-03-04 15:40:38,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions.
[2025-03-04 15:40:38,079 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions.
[2025-03-04 15:40:38,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-04 15:40:38,082 INFO  L432   stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions.
[2025-03-04 15:40:38,082 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-03-04 15:40:38,083 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions.
[2025-03-04 15:40:38,083 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-03-04 15:40:38,084 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-03-04 15:40:38,084 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-03-04 15:40:38,084 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-03-04 15:40:38,084 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1]
[2025-03-04 15:40:38,084 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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" 
[2025-03-04 15:40:38,084 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" 
[2025-03-04 15:40:38,085 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:38,085 INFO  L85        PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 2 times
[2025-03-04 15:40:38,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:38,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333577139]
[2025-03-04 15:40:38,085 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-04 15:40:38,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:38,098 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:38,113 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:38,114 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-04 15:40:38,114 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:38,114 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:40:38,118 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:38,130 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:38,132 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:38,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:38,134 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:40:38,137 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:38,137 INFO  L85        PathProgramCache]: Analyzing trace with hash 42907910, now seen corresponding path program 1 times
[2025-03-04 15:40:38,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:38,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655390090]
[2025-03-04 15:40:38,137 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-04 15:40:38,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:38,143 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-03-04 15:40:38,147 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-03-04 15:40:38,148 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:38,148 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:40:38,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:40:38,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-04 15:40:38,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655390090]
[2025-03-04 15:40:38,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655390090] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-04 15:40:38,257 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-04 15:40:38,257 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-04 15:40:38,257 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979359169]
[2025-03-04 15:40:38,257 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-04 15:40:38,257 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-03-04 15:40:38,257 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-04 15:40:38,257 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-04 15:40:38,257 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-04 15:40:38,258 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-03-04 15:40:38,305 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-04 15:40:38,305 INFO  L93              Difference]: Finished difference Result 9 states and 10 transitions.
[2025-03-04 15:40:38,305 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions.
[2025-03-04 15:40:38,306 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-03-04 15:40:38,306 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions.
[2025-03-04 15:40:38,306 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 9
[2025-03-04 15:40:38,306 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 9
[2025-03-04 15:40:38,307 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions.
[2025-03-04 15:40:38,307 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-03-04 15:40:38,307 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions.
[2025-03-04 15:40:38,307 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions.
[2025-03-04 15:40:38,307 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2025-03-04 15:40:38,308 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-03-04 15:40:38,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions.
[2025-03-04 15:40:38,308 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions.
[2025-03-04 15:40:38,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-04 15:40:38,309 INFO  L432   stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions.
[2025-03-04 15:40:38,309 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-03-04 15:40:38,309 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions.
[2025-03-04 15:40:38,310 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2025-03-04 15:40:38,310 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-03-04 15:40:38,310 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-03-04 15:40:38,310 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-03-04 15:40:38,310 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1]
[2025-03-04 15:40:38,310 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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" 
[2025-03-04 15:40:38,310 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" 
[2025-03-04 15:40:38,311 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:38,311 INFO  L85        PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 3 times
[2025-03-04 15:40:38,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:38,311 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792442740]
[2025-03-04 15:40:38,311 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-04 15:40:38,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:38,328 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:38,339 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:38,339 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-03-04 15:40:38,339 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:38,339 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:40:38,344 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:38,353 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:38,353 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:38,353 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:38,357 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:40:38,357 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:38,357 INFO  L85        PathProgramCache]: Analyzing trace with hash -1715136633, now seen corresponding path program 1 times
[2025-03-04 15:40:38,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:38,358 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154170544]
[2025-03-04 15:40:38,358 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-04 15:40:38,358 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:38,365 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-03-04 15:40:38,370 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-03-04 15:40:38,370 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:38,370 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:40:38,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:40:38,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-04 15:40:38,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154170544]
[2025-03-04 15:40:38,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154170544] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-04 15:40:38,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052723610]
[2025-03-04 15:40:38,567 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-04 15:40:38,567 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-04 15:40:38,567 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:38,569 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-04 15:40:38,571 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-04 15:40:38,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-03-04 15:40:38,617 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-03-04 15:40:38,617 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:38,617 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:40:38,619 INFO  L256         TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-04 15:40:38,621 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:40:38,656 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-03-04 15:40:38,674 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 25 treesize of output 13
[2025-03-04 15:40:38,682 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2025-03-04 15:40:38,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:40:38,688 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-04 15:40:38,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:40:38,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052723610] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-04 15:40:38,730 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-04 15:40:38,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10
[2025-03-04 15:40:38,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173397975]
[2025-03-04 15:40:38,730 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-04 15:40:38,730 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-03-04 15:40:38,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-04 15:40:38,730 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-04 15:40:38,730 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2025-03-04 15:40:38,730 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-03-04 15:40:38,790 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-04 15:40:38,790 INFO  L93              Difference]: Finished difference Result 15 states and 16 transitions.
[2025-03-04 15:40:38,790 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions.
[2025-03-04 15:40:38,790 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 13
[2025-03-04 15:40:38,790 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions.
[2025-03-04 15:40:38,790 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 15
[2025-03-04 15:40:38,790 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 15
[2025-03-04 15:40:38,790 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions.
[2025-03-04 15:40:38,791 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-03-04 15:40:38,791 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-03-04 15:40:38,791 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions.
[2025-03-04 15:40:38,791 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2025-03-04 15:40:38,791 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-03-04 15:40:38,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions.
[2025-03-04 15:40:38,791 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-03-04 15:40:38,797 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-04 15:40:38,797 INFO  L432   stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-03-04 15:40:38,797 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-03-04 15:40:38,797 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions.
[2025-03-04 15:40:38,798 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 13
[2025-03-04 15:40:38,798 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-03-04 15:40:38,798 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-03-04 15:40:38,798 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-03-04 15:40:38,798 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1]
[2025-03-04 15:40:38,798 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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" 
[2025-03-04 15:40:38,798 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" 
[2025-03-04 15:40:38,798 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:38,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 4 times
[2025-03-04 15:40:38,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:38,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381593836]
[2025-03-04 15:40:38,798 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-03-04 15:40:38,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:38,807 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes.
[2025-03-04 15:40:38,817 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:38,817 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-03-04 15:40:38,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:38,817 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:40:38,821 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:38,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:38,826 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:38,826 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:38,829 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:40:38,830 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:38,830 INFO  L85        PathProgramCache]: Analyzing trace with hash -2058696310, now seen corresponding path program 2 times
[2025-03-04 15:40:38,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:38,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595247419]
[2025-03-04 15:40:38,830 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-04 15:40:38,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:38,841 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes.
[2025-03-04 15:40:38,852 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements.
[2025-03-04 15:40:38,854 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-04 15:40:38,854 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:40:39,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:40:39,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-04 15:40:39,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595247419]
[2025-03-04 15:40:39,171 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595247419] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-04 15:40:39,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571922216]
[2025-03-04 15:40:39,171 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-04 15:40:39,171 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-04 15:40:39,171 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:39,175 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-04 15:40:39,176 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-04 15:40:39,220 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes.
[2025-03-04 15:40:39,234 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements.
[2025-03-04 15:40:39,234 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-04 15:40:39,234 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:40:39,235 INFO  L256         TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-03-04 15:40:39,236 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:40:39,244 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2025-03-04 15:40:39,252 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 25 treesize of output 13
[2025-03-04 15:40:39,262 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 25 treesize of output 13
[2025-03-04 15:40:39,269 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 25 treesize of output 13
[2025-03-04 15:40:39,281 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 25 treesize of output 13
[2025-03-04 15:40:39,287 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2025-03-04 15:40:39,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:40:39,290 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-04 15:40:39,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:40:39,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571922216] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-04 15:40:39,362 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-04 15:40:39,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 16
[2025-03-04 15:40:39,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131655491]
[2025-03-04 15:40:39,362 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-04 15:40:39,362 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-03-04 15:40:39,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-04 15:40:39,363 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-04 15:40:39,363 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240
[2025-03-04 15:40:39,363 INFO  L87              Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-04 15:40:39,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-04 15:40:39,463 INFO  L93              Difference]: Finished difference Result 25 states and 26 transitions.
[2025-03-04 15:40:39,463 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions.
[2025-03-04 15:40:39,463 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2025-03-04 15:40:39,465 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions.
[2025-03-04 15:40:39,465 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 25
[2025-03-04 15:40:39,466 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 25
[2025-03-04 15:40:39,466 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions.
[2025-03-04 15:40:39,466 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-03-04 15:40:39,466 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions.
[2025-03-04 15:40:39,466 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions.
[2025-03-04 15:40:39,467 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2025-03-04 15:40:39,467 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-03-04 15:40:39,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions.
[2025-03-04 15:40:39,467 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions.
[2025-03-04 15:40:39,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-03-04 15:40:39,470 INFO  L432   stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions.
[2025-03-04 15:40:39,470 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-03-04 15:40:39,470 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions.
[2025-03-04 15:40:39,470 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 23
[2025-03-04 15:40:39,470 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-03-04 15:40:39,470 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-03-04 15:40:39,471 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2025-03-04 15:40:39,471 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1]
[2025-03-04 15:40:39,471 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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" 
[2025-03-04 15:40:39,472 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" 
[2025-03-04 15:40:39,473 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:39,473 INFO  L85        PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 5 times
[2025-03-04 15:40:39,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:39,473 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320594148]
[2025-03-04 15:40:39,473 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-03-04 15:40:39,473 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:39,493 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:39,497 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:39,498 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-04 15:40:39,498 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:39,498 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:40:39,499 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:39,503 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:39,503 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:39,503 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:39,505 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:40:39,506 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:39,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -1231859057, now seen corresponding path program 3 times
[2025-03-04 15:40:39,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:39,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360225484]
[2025-03-04 15:40:39,506 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-04 15:40:39,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:39,519 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 10 equivalence classes.
[2025-03-04 15:40:39,557 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 23 of 23 statements.
[2025-03-04 15:40:39,557 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s)
[2025-03-04 15:40:39,557 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:39,557 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:40:39,560 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-03-04 15:40:39,569 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-03-04 15:40:39,569 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:39,569 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:39,573 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:40:39,574 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:39,574 INFO  L85        PathProgramCache]: Analyzing trace with hash -1008009808, now seen corresponding path program 1 times
[2025-03-04 15:40:39,574 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:39,574 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601866662]
[2025-03-04 15:40:39,574 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-04 15:40:39,574 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:39,587 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-03-04 15:40:39,608 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-03-04 15:40:39,608 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:39,608 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:39,609 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:40:39,613 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-03-04 15:40:39,632 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-03-04 15:40:39,633 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:39,633 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:39,640 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:40:56,769 WARN  L286               SmtUtils]: Spent 17.12s on a formula simplification. DAG size of input: 209 DAG size of output: 198 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2025-03-04 15:40:57,111 INFO  L204          LassoAnalysis]: Preferences:
[2025-03-04 15:40:57,111 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-03-04 15:40:57,112 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-03-04 15:40:57,112 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-03-04 15:40:57,112 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-03-04 15:40:57,112 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:57,112 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-03-04 15:40:57,112 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-03-04 15:40:57,113 INFO  L132   ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration5_Lasso
[2025-03-04 15:40:57,115 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-03-04 15:40:57,115 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-03-04 15:40:57,132 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,137 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,139 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,143 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,146 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,151 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,153 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,156 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,158 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,160 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,162 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,164 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,166 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:57,833 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-03-04 15:40:57,835 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-03-04 15:40:57,836 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:57,836 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:57,838 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:57,840 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2025-03-04 15:40:57,843 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:57,855 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:57,855 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-03-04 15:40:57,855 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:57,855 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:57,855 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:57,860 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-03-04 15:40:57,860 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-03-04 15:40:57,862 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:57,868 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0
[2025-03-04 15:40:57,868 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:57,868 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:57,870 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:57,871 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2025-03-04 15:40:57,872 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:57,882 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:57,882 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-03-04 15:40:57,882 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:57,882 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:57,883 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:57,883 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-03-04 15:40:57,883 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-03-04 15:40:57,884 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:57,890 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2025-03-04 15:40:57,890 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:57,890 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:57,892 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:57,893 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2025-03-04 15:40:57,894 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:57,904 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:57,904 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:57,904 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:57,904 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:57,906 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:57,906 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:57,910 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:57,917 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0
[2025-03-04 15:40:57,917 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:57,918 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:57,919 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:57,921 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2025-03-04 15:40:57,922 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:57,932 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:57,932 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-03-04 15:40:57,932 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:57,932 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:57,932 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:57,932 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-03-04 15:40:57,932 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-03-04 15:40:57,934 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:57,939 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2025-03-04 15:40:57,940 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:57,940 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:57,942 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:57,943 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2025-03-04 15:40:57,943 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:57,953 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:57,953 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-03-04 15:40:57,953 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:57,953 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:57,953 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:57,954 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-03-04 15:40:57,954 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-03-04 15:40:57,955 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:57,961 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0
[2025-03-04 15:40:57,961 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:57,961 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:57,963 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:57,964 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process
[2025-03-04 15:40:57,966 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:57,976 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:57,976 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:57,976 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:57,976 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:57,978 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:57,978 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:57,981 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:57,987 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0
[2025-03-04 15:40:57,987 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:57,987 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:57,990 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:57,990 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process
[2025-03-04 15:40:57,992 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,002 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,002 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-03-04 15:40:58,002 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,003 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,003 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,004 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-03-04 15:40:58,004 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-03-04 15:40:58,006 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,012 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0
[2025-03-04 15:40:58,012 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,012 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,014 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,015 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,017 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,027 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,027 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-03-04 15:40:58,028 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,028 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,028 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,029 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-03-04 15:40:58,029 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-03-04 15:40:58,030 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,038 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2025-03-04 15:40:58,038 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,039 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,041 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,042 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,044 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,054 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,054 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-03-04 15:40:58,054 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,054 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,054 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,056 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-03-04 15:40:58,056 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-03-04 15:40:58,057 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,063 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0
[2025-03-04 15:40:58,063 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,063 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,065 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,067 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,068 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,077 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,078 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,078 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,078 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,080 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:58,080 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:58,085 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,090 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0
[2025-03-04 15:40:58,091 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,091 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,093 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,094 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,095 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,105 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,105 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-03-04 15:40:58,105 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,105 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,105 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,106 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-03-04 15:40:58,106 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-03-04 15:40:58,107 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,112 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0
[2025-03-04 15:40:58,113 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,113 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,114 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,115 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,116 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,125 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,126 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-03-04 15:40:58,126 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,126 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,126 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,126 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-03-04 15:40:58,126 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-03-04 15:40:58,127 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,133 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0
[2025-03-04 15:40:58,133 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,133 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,135 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,135 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,136 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,147 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,147 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,147 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,147 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,150 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:58,150 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:58,155 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,161 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0
[2025-03-04 15:40:58,162 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,162 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,163 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,164 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,165 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,175 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,175 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,175 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,175 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,178 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:58,178 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:58,182 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,188 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0
[2025-03-04 15:40:58,189 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,189 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,190 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,191 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,193 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,203 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,203 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,203 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,203 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,206 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:58,206 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:58,209 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,214 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0
[2025-03-04 15:40:58,214 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,214 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,216 INFO  L229       MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,218 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,218 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,228 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,228 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,228 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,228 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,231 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:58,231 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:58,237 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,243 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0
[2025-03-04 15:40:58,243 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,243 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,246 INFO  L229       MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,247 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,248 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,258 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,258 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,258 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,258 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,261 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:58,261 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:58,267 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,274 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0
[2025-03-04 15:40:58,274 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,274 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,276 INFO  L229       MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,277 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,278 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,288 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,288 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,288 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,288 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,290 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:58,290 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:58,294 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:58,300 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0
[2025-03-04 15:40:58,301 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,301 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,303 INFO  L229       MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,304 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,305 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:58,315 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:58,315 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:58,316 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:58,316 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:58,319 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:58,319 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:58,324 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-03-04 15:40:58,334 INFO  L443   ModelExtractionUtils]: Simplification made 8 calls to the SMT solver.
[2025-03-04 15:40:58,350 INFO  L444   ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero.
[2025-03-04 15:40:58,352 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:58,352 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:58,356 INFO  L229       MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:58,358 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process
[2025-03-04 15:40:58,358 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-03-04 15:40:58,370 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-03-04 15:40:58,370 INFO  L474          LassoAnalysis]: Proved termination.
[2025-03-04 15:40:58,371 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) 0)_1) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) 0)_1 + 19
Supporting invariants []
[2025-03-04 15:40:58,377 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0
[2025-03-04 15:40:58,444 INFO  L156   tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed
[2025-03-04 15:40:58,451 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0
[2025-03-04 15:40:58,452 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL]
[2025-03-04 15:40:58,452 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,<LOCAL,main>]]]
[2025-03-04 15:40:58,478 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:58,489 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:58,501 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:58,501 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:58,501 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:40:58,502 INFO  L256         TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-04 15:40:58,503 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:40:58,519 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-03-04 15:40:58,545 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-03-04 15:40:58,545 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:58,545 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:40:58,546 INFO  L256         TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-03-04 15:40:58,548 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:40:58,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-03-04 15:40:58,706 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-03-04 15:40:58,707 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-03-04 15:40:58,759 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-03-04 15:40:58,760 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-03-04 15:40:58,761 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-03-04 15:40:58,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions.
[2025-03-04 15:40:58,765 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters.
[2025-03-04 15:40:58,766 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:40:58,766 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters.
[2025-03-04 15:40:58,766 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:40:58,766 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters.
[2025-03-04 15:40:58,766 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:40:58,766 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions.
[2025-03-04 15:40:58,767 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-03-04 15:40:58,768 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions.
[2025-03-04 15:40:58,768 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 23
[2025-03-04 15:40:58,768 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 24
[2025-03-04 15:40:58,768 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions.
[2025-03-04 15:40:58,768 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-03-04 15:40:58,768 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 47 states and 50 transitions.
[2025-03-04 15:40:58,768 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions.
[2025-03-04 15:40:58,771 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29.
[2025-03-04 15:40:58,771 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-03-04 15:40:58,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions.
[2025-03-04 15:40:58,771 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions.
[2025-03-04 15:40:58,771 INFO  L432   stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions.
[2025-03-04 15:40:58,771 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2025-03-04 15:40:58,771 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions.
[2025-03-04 15:40:58,772 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-03-04 15:40:58,772 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-03-04 15:40:58,772 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-03-04 15:40:58,772 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2025-03-04 15:40:58,772 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2025-03-04 15:40:58,772 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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" 
[2025-03-04 15:40:58,772 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" 
[2025-03-04 15:40:58,772 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:58,772 INFO  L85        PathProgramCache]: Analyzing trace with hash 1476575, now seen corresponding path program 1 times
[2025-03-04 15:40:58,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:58,772 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129620144]
[2025-03-04 15:40:58,772 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-04 15:40:58,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:58,782 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-03-04 15:40:58,792 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-03-04 15:40:58,796 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:58,796 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:58,796 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:40:58,798 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-03-04 15:40:58,800 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-03-04 15:40:58,800 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:58,800 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:58,802 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:40:58,802 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:58,802 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times
[2025-03-04 15:40:58,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:58,802 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885173619]
[2025-03-04 15:40:58,802 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-04 15:40:58,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:58,805 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:58,807 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:58,807 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:58,807 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:58,807 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:40:58,808 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:58,809 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:58,809 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:58,809 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:58,812 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:40:58,813 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:58,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 1418988862, now seen corresponding path program 1 times
[2025-03-04 15:40:58,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:58,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985737560]
[2025-03-04 15:40:58,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-04 15:40:58,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:40:58,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-03-04 15:40:58,822 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-03-04 15:40:58,822 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:58,822 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:58,822 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:40:58,823 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-03-04 15:40:58,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-03-04 15:40:58,826 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:58,826 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:40:58,828 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:40:59,199 INFO  L204          LassoAnalysis]: Preferences:
[2025-03-04 15:40:59,199 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-03-04 15:40:59,199 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-03-04 15:40:59,199 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-03-04 15:40:59,199 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-03-04 15:40:59,199 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:59,199 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-03-04 15:40:59,199 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-03-04 15:40:59,199 INFO  L132   ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration6_Lasso
[2025-03-04 15:40:59,199 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-03-04 15:40:59,199 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-03-04 15:40:59,201 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,450 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,452 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,453 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,455 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,457 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,458 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,460 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,462 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,463 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,465 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,468 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,469 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,473 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:40:59,702 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-03-04 15:40:59,702 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-03-04 15:40:59,702 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:59,702 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:59,706 INFO  L229       MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:59,706 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process
[2025-03-04 15:40:59,707 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:59,717 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:59,718 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:59,718 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:59,718 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:59,719 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:59,719 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:59,722 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:59,729 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0
[2025-03-04 15:40:59,730 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:59,730 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:59,732 INFO  L229       MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:59,734 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process
[2025-03-04 15:40:59,734 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:59,744 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:59,744 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:59,744 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:59,744 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:59,746 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:59,746 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:59,748 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:59,754 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0
[2025-03-04 15:40:59,754 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:59,755 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:59,757 INFO  L229       MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:59,758 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process
[2025-03-04 15:40:59,759 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:59,770 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:59,770 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:59,770 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:59,770 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:59,773 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:59,773 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:59,776 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:59,782 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0
[2025-03-04 15:40:59,783 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:59,783 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:59,784 INFO  L229       MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:59,786 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process
[2025-03-04 15:40:59,787 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:59,797 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:59,797 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:59,797 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:59,797 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:59,803 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:59,803 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:59,806 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:59,812 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0
[2025-03-04 15:40:59,812 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:59,812 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:59,814 INFO  L229       MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:59,815 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process
[2025-03-04 15:40:59,816 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:59,826 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:59,826 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:59,826 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:59,826 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:59,827 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:59,827 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:59,829 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:40:59,835 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0
[2025-03-04 15:40:59,835 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:59,835 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:59,837 INFO  L229       MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:59,838 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process
[2025-03-04 15:40:59,839 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:40:59,849 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:40:59,849 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:40:59,849 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:40:59,849 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:40:59,850 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:40:59,850 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:40:59,854 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-03-04 15:40:59,863 INFO  L443   ModelExtractionUtils]: Simplification made 8 calls to the SMT solver.
[2025-03-04 15:40:59,863 INFO  L444   ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero.
[2025-03-04 15:40:59,863 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:40:59,863 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:40:59,865 INFO  L229       MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:40:59,866 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process
[2025-03-04 15:40:59,866 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-03-04 15:40:59,876 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-03-04 15:40:59,876 INFO  L474          LassoAnalysis]: Proved termination.
[2025-03-04 15:40:59,877 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_2) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_2 + 23
Supporting invariants []
[2025-03-04 15:40:59,883 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0
[2025-03-04 15:40:59,914 INFO  L156   tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed
[2025-03-04 15:40:59,915 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2
[2025-03-04 15:40:59,915 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL]
[2025-03-04 15:40:59,915 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j~0!base,<LOCAL,main>]]]
[2025-03-04 15:40:59,924 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:59,930 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes.
[2025-03-04 15:40:59,937 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements.
[2025-03-04 15:40:59,937 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:59,937 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:40:59,938 INFO  L256         TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-04 15:40:59,938 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:40:59,944 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:40:59,947 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:40:59,947 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:40:59,947 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:40:59,947 INFO  L256         TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-04 15:40:59,948 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:40:59,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:40:59,959 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2025-03-04 15:40:59,959 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-03-04 15:40:59,977 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-03-04 15:40:59,977 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-03-04 15:40:59,977 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-03-04 15:40:59,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions.
[2025-03-04 15:40:59,978 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters.
[2025-03-04 15:40:59,978 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:40:59,978 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters.
[2025-03-04 15:40:59,978 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:40:59,978 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters.
[2025-03-04 15:40:59,978 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:40:59,978 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions.
[2025-03-04 15:40:59,981 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-03-04 15:40:59,982 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 55 states and 59 transitions.
[2025-03-04 15:40:59,983 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 7
[2025-03-04 15:40:59,983 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 7
[2025-03-04 15:40:59,984 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions.
[2025-03-04 15:40:59,984 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-03-04 15:40:59,984 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 55 states and 59 transitions.
[2025-03-04 15:40:59,984 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions.
[2025-03-04 15:40:59,985 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50.
[2025-03-04 15:40:59,985 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-03-04 15:40:59,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions.
[2025-03-04 15:40:59,986 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 50 states and 53 transitions.
[2025-03-04 15:40:59,986 INFO  L432   stractBuchiCegarLoop]: Abstraction has 50 states and 53 transitions.
[2025-03-04 15:40:59,986 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2025-03-04 15:40:59,986 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions.
[2025-03-04 15:40:59,986 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2025-03-04 15:40:59,986 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-03-04 15:40:59,986 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-03-04 15:40:59,987 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1]
[2025-03-04 15:40:59,987 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2025-03-04 15:40:59,987 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~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;" "call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1;" "assume true;call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 10;havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4);" 
[2025-03-04 15:40:59,988 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem6#1 < 12;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1;" 
[2025-03-04 15:40:59,988 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:40:59,988 INFO  L85        PathProgramCache]: Analyzing trace with hash 1965183887, now seen corresponding path program 2 times
[2025-03-04 15:40:59,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:40:59,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963675831]
[2025-03-04 15:40:59,988 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-04 15:40:59,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:41:00,000 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes.
[2025-03-04 15:41:00,015 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-04 15:41:00,015 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-04 15:41:00,015 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:41:00,015 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:41:00,018 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-04 15:41:00,027 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-04 15:41:00,028 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:41:00,028 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:41:00,032 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:41:00,033 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:41:00,033 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times
[2025-03-04 15:41:00,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:41:00,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458797330]
[2025-03-04 15:41:00,033 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-04 15:41:00,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:41:00,039 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:41:00,040 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:41:00,040 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-04 15:41:00,040 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:41:00,040 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:41:00,041 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:41:00,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:41:00,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:41:00,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:41:00,044 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:41:00,044 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:41:00,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -1243894546, now seen corresponding path program 3 times
[2025-03-04 15:41:00,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-04 15:41:00,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97605143]
[2025-03-04 15:41:00,044 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-04 15:41:00,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-04 15:41:00,059 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 11 equivalence classes.
[2025-03-04 15:41:00,103 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 29 of 29 statements.
[2025-03-04 15:41:00,103 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2025-03-04 15:41:00,104 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:41:00,104 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-04 15:41:00,106 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-03-04 15:41:00,116 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-03-04 15:41:00,116 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:41:00,116 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-04 15:41:00,121 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-04 15:41:00,200 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0
[2025-03-04 15:41:00,207 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0
[2025-03-04 15:41:23,363 WARN  L286               SmtUtils]: Spent 23.14s on a formula simplification. DAG size of input: 272 DAG size of output: 237 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2025-03-04 15:41:23,484 INFO  L204          LassoAnalysis]: Preferences:
[2025-03-04 15:41:23,484 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-03-04 15:41:23,484 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-03-04 15:41:23,484 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-03-04 15:41:23,484 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-03-04 15:41:23,484 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:41:23,484 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-03-04 15:41:23,484 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-03-04 15:41:23,484 INFO  L132   ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration7_Lasso
[2025-03-04 15:41:23,484 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-03-04 15:41:23,484 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-03-04 15:41:23,486 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,489 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,671 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,673 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,674 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,675 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,676 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,677 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,679 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,680 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,684 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,690 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,691 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,693 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-03-04 15:41:23,883 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-03-04 15:41:23,883 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-03-04 15:41:23,883 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:41:23,883 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:41:23,885 INFO  L229       MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:41:23,886 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process
[2025-03-04 15:41:23,889 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:41:23,899 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:41:23,900 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:41:23,900 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:41:23,900 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:41:23,901 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:41:23,901 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:41:23,903 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:41:23,909 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0
[2025-03-04 15:41:23,910 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:41:23,910 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:41:23,911 INFO  L229       MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:41:23,912 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process
[2025-03-04 15:41:23,913 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:41:23,924 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:41:23,924 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:41:23,924 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:41:23,924 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:41:23,925 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:41:23,926 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:41:23,929 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:41:23,935 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0
[2025-03-04 15:41:23,935 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:41:23,935 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:41:23,937 INFO  L229       MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:41:23,938 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process
[2025-03-04 15:41:23,938 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:41:23,948 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:41:23,948 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:41:23,948 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:41:23,948 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:41:23,951 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:41:23,951 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:41:23,956 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:41:23,962 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0
[2025-03-04 15:41:23,963 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:41:23,963 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:41:23,964 INFO  L229       MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:41:23,965 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process
[2025-03-04 15:41:23,966 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:41:23,976 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:41:23,977 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:41:23,977 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:41:23,977 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:41:23,977 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:41:23,978 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:41:23,980 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:41:23,986 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0
[2025-03-04 15:41:23,986 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:41:23,986 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:41:23,987 INFO  L229       MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:41:23,988 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process
[2025-03-04 15:41:23,989 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:41:23,999 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:41:23,999 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:41:23,999 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:41:23,999 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:41:24,001 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:41:24,001 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:41:24,005 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:41:24,011 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0
[2025-03-04 15:41:24,011 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:41:24,011 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:41:24,013 INFO  L229       MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:41:24,013 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process
[2025-03-04 15:41:24,015 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:41:24,025 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:41:24,026 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:41:24,026 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:41:24,026 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:41:24,026 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:41:24,026 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:41:24,029 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-03-04 15:41:24,034 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0
[2025-03-04 15:41:24,034 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:41:24,034 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:41:24,036 INFO  L229       MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:41:24,037 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process
[2025-03-04 15:41:24,038 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-03-04 15:41:24,048 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-03-04 15:41:24,048 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-03-04 15:41:24,048 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-03-04 15:41:24,048 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-03-04 15:41:24,050 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-03-04 15:41:24,050 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-03-04 15:41:24,055 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-03-04 15:41:24,069 INFO  L443   ModelExtractionUtils]: Simplification made 7 calls to the SMT solver.
[2025-03-04 15:41:24,070 INFO  L444   ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero.
[2025-03-04 15:41:24,070 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-03-04 15:41:24,070 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-04 15:41:24,072 INFO  L229       MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-03-04 15:41:24,072 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process
[2025-03-04 15:41:24,073 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-03-04 15:41:24,084 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-03-04 15:41:24,084 INFO  L474          LassoAnalysis]: Proved termination.
[2025-03-04 15:41:24,084 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~j~0#1.base) 0)_1) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~j~0#1.base) 0)_1 + 23
Supporting invariants []
[2025-03-04 15:41:24,090 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0
[2025-03-04 15:41:24,123 INFO  L156   tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed
[2025-03-04 15:41:24,125 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2
[2025-03-04 15:41:24,125 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL]
[2025-03-04 15:41:24,125 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j~0!base,<LOCAL,main>]]]
[2025-03-04 15:41:24,140 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:41:24,154 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-04 15:41:24,179 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-04 15:41:24,179 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:41:24,179 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:41:24,180 INFO  L256         TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-04 15:41:24,181 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:41:24,247 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:41:24,249 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:41:24,249 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:41:24,249 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:41:24,250 INFO  L256         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-04 15:41:24,251 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:41:24,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:41:24,264 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates 
[2025-03-04 15:41:24,264 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-04 15:41:24,294 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 73 transitions. Complement of second has 8 states.
[2025-03-04 15:41:24,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-03-04 15:41:24,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-04 15:41:24,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions.
[2025-03-04 15:41:24,295 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 27 letters. Loop has 2 letters.
[2025-03-04 15:41:24,296 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:41:24,296 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-03-04 15:41:24,312 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:41:24,327 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-04 15:41:24,375 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0
[2025-03-04 15:41:24,391 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-04 15:41:24,392 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:41:24,392 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:41:24,393 INFO  L256         TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-04 15:41:24,395 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:41:24,465 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:41:24,468 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:41:24,468 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:41:24,468 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:41:24,468 INFO  L256         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-04 15:41:24,469 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:41:24,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:41:24,483 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates 
[2025-03-04 15:41:24,483 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-04 15:41:24,526 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 73 transitions. Complement of second has 8 states.
[2025-03-04 15:41:24,527 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-03-04 15:41:24,527 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-04 15:41:24,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions.
[2025-03-04 15:41:24,528 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 27 letters. Loop has 2 letters.
[2025-03-04 15:41:24,528 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:41:24,528 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-03-04 15:41:24,542 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-04 15:41:24,556 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-04 15:41:24,585 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-04 15:41:24,585 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:41:24,585 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:41:24,586 INFO  L256         TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-04 15:41:24,587 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:41:24,659 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes.
[2025-03-04 15:41:24,662 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements.
[2025-03-04 15:41:24,662 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-04 15:41:24,662 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-04 15:41:24,662 INFO  L256         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-04 15:41:24,663 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-04 15:41:24,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-04 15:41:24,683 INFO  L141   lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates 
[2025-03-04 15:41:24,683 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-04 15:41:24,722 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 82 transitions. Complement of second has 7 states.
[2025-03-04 15:41:24,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 
[2025-03-04 15:41:24,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-04 15:41:24,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions.
[2025-03-04 15:41:24,724 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 27 letters. Loop has 2 letters.
[2025-03-04 15:41:24,725 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:41:24,725 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 29 letters. Loop has 2 letters.
[2025-03-04 15:41:24,725 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:41:24,725 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 27 letters. Loop has 4 letters.
[2025-03-04 15:41:24,725 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-03-04 15:41:24,725 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions.
[2025-03-04 15:41:24,726 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-03-04 15:41:24,726 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions.
[2025-03-04 15:41:24,726 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2025-03-04 15:41:24,726 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2025-03-04 15:41:24,729 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2025-03-04 15:41:24,729 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-03-04 15:41:24,729 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-04 15:41:24,729 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-04 15:41:24,729 INFO  L432   stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-04 15:41:24,729 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 8 ============
[2025-03-04 15:41:24,729 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2025-03-04 15:41:24,729 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-03-04 15:41:24,729 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2025-03-04 15:41:24,734 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:41:24 BoogieIcfgContainer
[2025-03-04 15:41:24,734 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2025-03-04 15:41:24,735 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-04 15:41:24,735 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-04 15:41:24,735 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-04 15:41:24,736 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:40:37" (3/4) ...
[2025-03-04 15:41:24,737 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-04 15:41:24,737 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-04 15:41:24,738 INFO  L158              Benchmark]: Toolchain (without parser) took 47597.24ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 110.6MB in the beginning and 340.2MB in the end (delta: -229.6MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB.
[2025-03-04 15:41:24,738 INFO  L158              Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-04 15:41:24,738 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 301.26ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 94.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-04 15:41:24,738 INFO  L158              Benchmark]: Boogie Procedure Inliner took 30.95ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-04 15:41:24,738 INFO  L158              Benchmark]: Boogie Preprocessor took 34.72ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-04 15:41:24,738 INFO  L158              Benchmark]: IcfgBuilder took 232.07ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 79.0MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-04 15:41:24,739 INFO  L158              Benchmark]: BuchiAutomizer took 46992.15ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 79.0MB in the beginning and 340.3MB in the end (delta: -261.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB.
[2025-03-04 15:41:24,739 INFO  L158              Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 427.8MB. Free memory was 340.3MB in the beginning and 340.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-04 15:41:24,740 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.32ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 301.26ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 94.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 30.95ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 34.72ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 232.07ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 79.0MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 46992.15ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 79.0MB in the beginning and 340.3MB in the end (delta: -261.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB.
 * Witness Printer took 2.35ms. Allocated memory is still 427.8MB. Free memory was 340.3MB in the beginning and 340.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #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[~i~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#2
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j~0!base,<LOCAL,main>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#2
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j~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 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 46.9s and 8 iterations.  TraceHistogramMax:10. Analysis of lassos took 45.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. 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, 64 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 58 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks:   Lassos: inital204 mio100 ax108 hnf100 lsp91 ukn76 mio100 lsp23 div100 bol100 ite100 ukn100 eq159 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.0s
  - TerminationAnalysisResult: Termination proven
    Buchi Automizer proved that your program is terminating
RESULT: Ultimate proved your program to be correct!
[2025-03-04 15:41:24,752 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-04 15:41:24,952 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-04 15:41:25,154 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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