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


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


Checking for termination
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(F end) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '2e8f354936443b9a529fcf41dfa5e3c742b35e7f73ef50360a09d67c1a48d74d']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2e8f354936443b9a529fcf41dfa5e3c742b35e7f73ef50360a09d67c1a48d74d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 23:51:55,400 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-07 23:51:55,461 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf
[2024-11-07 23:51:55,468 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 23:51:55,470 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 23:51:55,492 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 23:51:55,492 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 23:51:55,492 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 23:51:55,493 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 23:51:55,493 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-07 23:51:55,493 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 23:51:55,493 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-07 23:51:55,493 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-07 23:51:55,495 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-07 23:51:55,495 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2024-11-07 23:51:55,495 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2024-11-07 23:51:55,495 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2024-11-07 23:51:55,495 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2024-11-07 23:51:55,496 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-07 23:51:55,496 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-07 23:51:55,497 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-07 23:51:55,497 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 23:51:55,497 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-07 23:51:55,498 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-07 23:51:55,498 INFO  L153        SettingsManager]:  * TransformationType=MODULO_NEIGHBOR
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e8f354936443b9a529fcf41dfa5e3c742b35e7f73ef50360a09d67c1a48d74d
[2024-11-07 23:51:55,712 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 23:51:55,720 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 23:51:55,721 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 23:51:55,722 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-07 23:51:55,722 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-07 23:51:55,723 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i
[2024-11-07 23:51:56,836 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-07 23:51:57,076 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-07 23:51:57,076 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i
[2024-11-07 23:51:57,087 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4e07084f/fbdd0973088347d48af5cfd7ecceb662/FLAGd14fcffe6
[2024-11-07 23:51:57,398 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4e07084f/fbdd0973088347d48af5cfd7ecceb662
[2024-11-07 23:51:57,400 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 23:51:57,401 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 23:51:57,402 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 23:51:57,402 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 23:51:57,404 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 23:51:57,405 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,405 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1895371e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57, skipping insertion in model container
[2024-11-07 23:51:57,405 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,426 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-07 23:51:57,563 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-07 23:51:57,570 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-07 23:51:57,597 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-07 23:51:57,616 INFO  L204         MainTranslator]: Completed translation
[2024-11-07 23:51:57,617 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57 WrapperNode
[2024-11-07 23:51:57,617 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 23:51:57,618 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 23:51:57,618 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 23:51:57,618 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 23:51:57,622 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,631 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,644 INFO  L138                Inliner]: procedures = 111, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76
[2024-11-07 23:51:57,644 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 23:51:57,645 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 23:51:57,645 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 23:51:57,645 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 23:51:57,650 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,650 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,653 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,664 INFO  L175           MemorySlicer]: Split 11 memory accesses to 2 slices as follows [6, 5]. 55 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [3, 2].
[2024-11-07 23:51:57,666 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,666 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,670 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,676 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,677 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,678 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,682 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 23:51:57,683 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 23:51:57,683 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 23:51:57,683 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-07 23:51:57,684 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (1/1) ...
[2024-11-07 23:51:57,690 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:51:57,702 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:51:57,715 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:51:57,717 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-07 23:51:57,736 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-07 23:51:57,737 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-07 23:51:57,737 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-07 23:51:57,737 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-07 23:51:57,737 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-07 23:51:57,737 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 23:51:57,737 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 23:51:57,738 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 23:51:57,811 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-07 23:51:57,813 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 23:51:57,887 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2024-11-07 23:51:57,887 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-07 23:51:57,892 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 23:51:57,893 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 23:51:57,893 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:51:57 BoogieIcfgContainer
[2024-11-07 23:51:57,893 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 23:51:57,894 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-07 23:51:57,894 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2024-11-07 23:51:57,897 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2024-11-07 23:51:57,897 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:51:57,897 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 11:51:57" (1/3) ...
[2024-11-07 23:51:57,898 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40a83a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:51:57, skipping insertion in model container
[2024-11-07 23:51:57,898 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:51:57,898 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:51:57" (2/3) ...
[2024-11-07 23:51:57,898 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40a83a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:51:57, skipping insertion in model container
[2024-11-07 23:51:57,898 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-07 23:51:57,898 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:51:57" (3/3) ...
[2024-11-07 23:51:57,899 INFO  L332   chiAutomizerObserver]: Analyzing ICFG b.05-alloca.i
[2024-11-07 23:51:57,929 INFO  L300   stractBuchiCegarLoop]: Interprodecural is true
[2024-11-07 23:51:57,929 INFO  L301   stractBuchiCegarLoop]: Hoare is None
[2024-11-07 23:51:57,929 INFO  L302   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-07 23:51:57,929 INFO  L303   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-07 23:51:57,929 INFO  L304   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-07 23:51:57,930 INFO  L305   stractBuchiCegarLoop]: Difference is false
[2024-11-07 23:51:57,930 INFO  L306   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-07 23:51:57,930 INFO  L310   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-07 23:51:57,933 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:51:57,943 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2024-11-07 23:51:57,945 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:51:57,945 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:51:57,948 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-07 23:51:57,948 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:51:57,948 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-07 23:51:57,948 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:51:57,952 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2024-11-07 23:51:57,952 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:51:57,952 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:51:57,952 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-07 23:51:57,952 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:51:57,957 INFO  L745   eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#0(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1; 10#L554-11true 
[2024-11-07 23:51:57,957 INFO  L747   eck$LassoCheckResult]: Loop: 10#L554-11true call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 4#L554-1true assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 >= 0; 13#L554-3true test_fun_#t~short9#1 := test_fun_#t~short7#1; 7#L554-4true assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 1073741824; 14#L554-6true test_fun_#t~short11#1 := test_fun_#t~short9#1; 9#L554-7true assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1; 3#L554-9true assume !!test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#0(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1; 10#L554-11true 
[2024-11-07 23:51:57,963 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:51:57,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2024-11-07 23:51:57,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:51:57,968 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095264968]
[2024-11-07 23:51:57,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:51:57,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:51:58,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:51:58,045 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:51:58,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:51:58,072 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:51:58,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:51:58,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -334850282, now seen corresponding path program 1 times
[2024-11-07 23:51:58,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:51:58,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077893272]
[2024-11-07 23:51:58,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:51:58,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:51:58,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:51:58,091 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:51:58,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:51:58,105 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:51:58,106 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:51:58,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 1211446548, now seen corresponding path program 1 times
[2024-11-07 23:51:58,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:51:58,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684665669]
[2024-11-07 23:51:58,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:51:58,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:51:58,162 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:51:58,162 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:51:58,184 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:51:58,191 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:51:58,652 INFO  L204          LassoAnalysis]: Preferences:
[2024-11-07 23:51:58,654 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2024-11-07 23:51:58,654 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-07 23:51:58,654 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2024-11-07 23:51:58,654 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2024-11-07 23:51:58,654 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:51:58,654 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-07 23:51:58,655 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2024-11-07 23:51:58,655 INFO  L132   ssoRankerPreferences]: Filename of dumped script: b.05-alloca.i_Iteration1_Lasso
[2024-11-07 23:51:58,655 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-07 23:51:58,655 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2024-11-07 23:51:58,664 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,670 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,672 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,674 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,675 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,924 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,928 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,929 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,931 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,934 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,936 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,938 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,941 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,943 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,945 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,947 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,949 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:58,951 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-07 23:51:59,204 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2024-11-07 23:51:59,206 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2024-11-07 23:51:59,207 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:51:59,207 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:51:59,209 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:51:59,210 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2024-11-07 23:51:59,211 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
[2024-11-07 23:51:59,223 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:51:59,223 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:51:59,224 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:51:59,224 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:51:59,224 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:51:59,227 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:51:59,227 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:51:59,229 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:51:59,239 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0
[2024-11-07 23:51:59,239 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:51:59,239 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:51:59,241 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:51:59,242 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2024-11-07 23:51:59,243 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
[2024-11-07 23:51:59,254 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:51:59,254 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:51:59,254 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:51:59,254 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:51:59,254 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:51:59,254 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:51:59,254 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:51:59,255 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:51:59,265 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0
[2024-11-07 23:51:59,266 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:51:59,266 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:51:59,267 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:51:59,268 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2024-11-07 23:51:59,268 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-07 23:51:59,278 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:51:59,278 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:51:59,278 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:51:59,278 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:51:59,278 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:51:59,278 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:51:59,278 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:51:59,279 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:51:59,289 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0
[2024-11-07 23:51:59,289 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:51:59,289 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:51:59,291 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:51:59,294 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2024-11-07 23:51:59,295 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-07 23:51:59,305 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:51:59,306 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-07 23:51:59,306 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:51:59,306 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:51:59,306 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:51:59,307 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-07 23:51:59,307 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-07 23:51:59,308 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:51:59,317 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2024-11-07 23:51:59,318 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:51:59,318 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:51:59,319 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:51:59,321 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2024-11-07 23:51:59,322 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
[2024-11-07 23:51:59,332 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:51:59,332 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:51:59,332 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:51:59,332 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:51:59,337 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:51:59,337 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:51:59,349 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-07 23:51:59,359 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0
[2024-11-07 23:51:59,359 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:51:59,359 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:51:59,361 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:51:59,362 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2024-11-07 23:51:59,363 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
[2024-11-07 23:51:59,373 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-11-07 23:51:59,373 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-07 23:51:59,373 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-07 23:51:59,373 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-07 23:51:59,379 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-07 23:51:59,379 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-07 23:51:59,387 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-07 23:51:59,420 INFO  L443   ModelExtractionUtils]: Simplification made 14 calls to the SMT solver.
[2024-11-07 23:51:59,422 INFO  L444   ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero.
[2024-11-07 23:51:59,423 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-07 23:51:59,423 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 23:51:59,425 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-07 23:51:59,426 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2024-11-07 23:51:59,429 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-07 23:51:59,440 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-07 23:51:59,440 INFO  L474          LassoAnalysis]: Proved termination.
[2024-11-07 23:51:59,441 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1
Supporting invariants []
[2024-11-07 23:51:59,452 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2024-11-07 23:51:59,486 INFO  L156   tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed
[2024-11-07 23:51:59,492 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1
[2024-11-07 23:51:59,493 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
[2024-11-07 23:51:59,493 WARN  L976   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x_ref~0!base,<LOCAL,test_fun>]]]
[2024-11-07 23:51:59,512 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:51:59,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:51:59,537 INFO  L255         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 23:51:59,538 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:51:59,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:51:59,559 INFO  L255         TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 23:51:59,560 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 23:51:59,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:51:59,688 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 
[2024-11-07 23:51:59,689 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand  has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:51:59,773 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand  has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand  has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 57 transitions. Complement of second has 10 states.
[2024-11-07 23:51:59,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states 
[2024-11-07 23:51:59,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:51:59,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions.
[2024-11-07 23:51:59,784 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 7 letters.
[2024-11-07 23:51:59,784 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:51:59,784 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 9 letters. Loop has 7 letters.
[2024-11-07 23:51:59,784 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:51:59,784 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 14 letters.
[2024-11-07 23:51:59,785 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-11-07 23:51:59,785 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions.
[2024-11-07 23:51:59,786 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2024-11-07 23:51:59,788 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 24 states and 33 transitions.
[2024-11-07 23:51:59,788 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 10
[2024-11-07 23:51:59,789 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 11
[2024-11-07 23:51:59,789 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions.
[2024-11-07 23:51:59,789 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:51:59,789 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions.
[2024-11-07 23:51:59,798 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions.
[2024-11-07 23:51:59,804 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23.
[2024-11-07 23:51:59,805 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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)
[2024-11-07 23:51:59,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions.
[2024-11-07 23:51:59,806 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions.
[2024-11-07 23:51:59,807 INFO  L425   stractBuchiCegarLoop]: Abstraction has 23 states and 32 transitions.
[2024-11-07 23:51:59,807 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-07 23:51:59,807 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions.
[2024-11-07 23:51:59,807 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2024-11-07 23:51:59,808 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:51:59,808 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:51:59,808 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-07 23:51:59,808 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:51:59,809 INFO  L745   eck$LassoCheckResult]: Stem: 180#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#0(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1; 186#L554-11 call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 173#L554-1 
[2024-11-07 23:51:59,809 INFO  L747   eck$LassoCheckResult]: Loop: 173#L554-1 assume !test_fun_#t~short7#1; 176#L554-3 test_fun_#t~short9#1 := test_fun_#t~short7#1; 177#L554-4 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 1073741824; 183#L554-6 test_fun_#t~short11#1 := test_fun_#t~short9#1; 167#L554-7 assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1; 168#L554-9 assume !!test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#0(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1; 171#L554-11 call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 173#L554-1 
[2024-11-07 23:51:59,809 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:51:59,811 INFO  L85        PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times
[2024-11-07 23:51:59,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:51:59,811 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819320221]
[2024-11-07 23:51:59,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:51:59,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:51:59,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:51:59,830 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:51:59,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:51:59,848 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:51:59,848 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:51:59,848 INFO  L85        PathProgramCache]: Analyzing trace with hash -74889736, now seen corresponding path program 1 times
[2024-11-07 23:51:59,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:51:59,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968140533]
[2024-11-07 23:51:59,849 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:51:59,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:51:59,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:51:59,909 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:51:59,910 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:51:59,910 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968140533]
[2024-11-07 23:51:59,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968140533] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:51:59,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:51:59,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 23:51:59,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175148520]
[2024-11-07 23:51:59,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:51:59,913 INFO  L762   eck$LassoCheckResult]: loop already infeasible
[2024-11-07 23:51:59,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:51:59,914 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 23:51:59,915 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 23:51:59,915 INFO  L87              Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 11 Second operand  has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:51:59,936 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:51:59,936 INFO  L93              Difference]: Finished difference Result 24 states and 31 transitions.
[2024-11-07 23:51:59,936 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions.
[2024-11-07 23:51:59,936 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2024-11-07 23:51:59,937 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 31 transitions.
[2024-11-07 23:51:59,937 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 10
[2024-11-07 23:51:59,937 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 10
[2024-11-07 23:51:59,937 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions.
[2024-11-07 23:51:59,937 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-07 23:51:59,937 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions.
[2024-11-07 23:51:59,937 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions.
[2024-11-07 23:51:59,938 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23.
[2024-11-07 23:51:59,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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)
[2024-11-07 23:51:59,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions.
[2024-11-07 23:51:59,938 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions.
[2024-11-07 23:51:59,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-07 23:51:59,941 INFO  L425   stractBuchiCegarLoop]: Abstraction has 23 states and 30 transitions.
[2024-11-07 23:51:59,941 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-07 23:51:59,941 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions.
[2024-11-07 23:51:59,941 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2024-11-07 23:51:59,941 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-07 23:51:59,941 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-07 23:51:59,941 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-07 23:51:59,941 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 23:51:59,942 INFO  L745   eck$LassoCheckResult]: Stem: 229#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#0(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1; 236#L554-11 call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 227#L554-1 
[2024-11-07 23:51:59,942 INFO  L747   eck$LassoCheckResult]: Loop: 227#L554-1 assume !test_fun_#t~short7#1; 231#L554-3 test_fun_#t~short9#1 := test_fun_#t~short7#1; 232#L554-4 assume !test_fun_#t~short9#1; 237#L554-6 test_fun_#t~short11#1 := test_fun_#t~short9#1; 221#L554-7 assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1; 222#L554-9 assume !!test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#0(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1; 225#L554-11 call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 227#L554-1 
[2024-11-07 23:51:59,942 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:51:59,942 INFO  L85        PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times
[2024-11-07 23:51:59,942 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:51:59,942 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580525518]
[2024-11-07 23:51:59,942 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:51:59,942 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:51:59,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:51:59,961 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 23:51:59,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 23:51:59,977 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 23:51:59,978 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 23:51:59,978 INFO  L85        PathProgramCache]: Analyzing trace with hash -73042694, now seen corresponding path program 1 times
[2024-11-07 23:51:59,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 23:51:59,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145032667]
[2024-11-07 23:51:59,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 23:51:59,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 23:51:59,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 23:52:00,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 23:52:00,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 23:52:00,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145032667]
[2024-11-07 23:52:00,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145032667] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 23:52:00,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 23:52:00,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 23:52:00,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066172001]
[2024-11-07 23:52:00,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 23:52:00,022 INFO  L762   eck$LassoCheckResult]: loop already infeasible
[2024-11-07 23:52:00,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 23:52:00,022 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 23:52:00,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 23:52:00,022 INFO  L87              Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand  has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 23:52:00,044 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 23:52:00,045 INFO  L93              Difference]: Finished difference Result 24 states and 26 transitions.
[2024-11-07 23:52:00,045 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions.
[2024-11-07 23:52:00,045 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2024-11-07 23:52:00,045 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions.
[2024-11-07 23:52:00,045 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2024-11-07 23:52:00,045 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2024-11-07 23:52:00,045 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2024-11-07 23:52:00,045 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-07 23:52:00,045 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-07 23:52:00,045 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-07 23:52:00,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-07 23:52:00,047 INFO  L425   stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-07 23:52:00,047 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-07 23:52:00,047 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2024-11-07 23:52:00,047 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2024-11-07 23:52:00,047 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2024-11-07 23:52:00,052 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.11 11:52:00 BoogieIcfgContainer
[2024-11-07 23:52:00,052 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2024-11-07 23:52:00,052 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 23:52:00,052 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-07 23:52:00,053 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-07 23:52:00,053 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:51:57" (3/4) ...
[2024-11-07 23:52:00,054 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-07 23:52:00,055 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 23:52:00,055 INFO  L158              Benchmark]: Toolchain (without parser) took 2654.71ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.3MB in the beginning and 73.1MB in the end (delta: 18.2MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB.
[2024-11-07 23:52:00,056 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:52:00,056 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 215.69ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 75.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 23:52:00,056 INFO  L158              Benchmark]: Boogie Procedure Inliner took 26.34ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 73.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:52:00,056 INFO  L158              Benchmark]: Boogie Preprocessor took 37.49ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 72.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:52:00,056 INFO  L158              Benchmark]: RCFGBuilder took 210.38ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 60.6MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 23:52:00,056 INFO  L158              Benchmark]: BuchiAutomizer took 2158.53ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 60.4MB in the beginning and 73.1MB in the end (delta: -12.7MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB.
[2024-11-07 23:52:00,057 INFO  L158              Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 159.4MB. Free memory was 73.1MB in the beginning and 73.1MB in the end (delta: 40.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 23:52:00,058 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.19ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 215.69ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 75.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 26.34ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 73.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 37.49ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 72.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * RCFGBuilder took 210.38ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 60.6MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 2158.53ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 60.4MB in the beginning and 73.1MB in the end (delta: -12.7MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB.
 * Witness Printer took 2.54ms. Allocated memory is still 159.4MB. Free memory was 73.1MB in the beginning and 73.1MB in the end (delta: 40.4kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#1
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x_ref~0!base,<LOCAL,test_fun>]]]
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 2.1s and 4 iterations.  TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 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 [1, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 26 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks:   Lassos: inital181 mio100 ax109 hnf100 lsp90 ukn76 mio100 lsp31 div100 bol100 ite100 ukn100 eq195 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 2 VariablesLoop: 2 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!
[2024-11-07 23:52:00,073 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0
[2024-11-07 23:52:00,277 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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