./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/Velroyen-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 0301294b5b50ee43814efe2bd49b834b2b8f0455334e679e746f10ee76ed616a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:04:34,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:04:34,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:04:34,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:04:34,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:04:34,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:04:34,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:04:34,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:04:34,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:04:34,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:04:34,524 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:04:34,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:04:34,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:04:34,525 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:04:34,525 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:04:34,525 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:04:34,525 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:04:34,525 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:04:34,526 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:04:34,526 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:04:34,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:04:34,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:04:34,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:04:34,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:04:34,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:04:34,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:04:34,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:04:34,527 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:04:34,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:04:34,527 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:04:34,527 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:04:34,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:04:34,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:04:34,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:04:34,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:04:34,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:04:34,528 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:04:34,528 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 -> 0301294b5b50ee43814efe2bd49b834b2b8f0455334e679e746f10ee76ed616a [2025-02-06 19:04:34,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:04:34,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:04:34,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:04:34,860 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:04:34,860 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:04:34,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2025-02-06 19:04:36,258 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d901f43cb/b458f4df73cd4a74b3e0becd3fd55e86/FLAG2b856c52d [2025-02-06 19:04:36,530 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:04:36,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2025-02-06 19:04:36,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d901f43cb/b458f4df73cd4a74b3e0becd3fd55e86/FLAG2b856c52d [2025-02-06 19:04:36,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d901f43cb/b458f4df73cd4a74b3e0becd3fd55e86 [2025-02-06 19:04:36,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:04:36,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:04:36,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:04:36,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:04:36,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:04:36,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d32f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36, skipping insertion in model container [2025-02-06 19:04:36,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:04:36,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:04:36,829 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:04:36,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:04:36,884 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:04:36,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36 WrapperNode [2025-02-06 19:04:36,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:04:36,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:04:36,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:04:36,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:04:36,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,916 INFO L138 Inliner]: procedures = 110, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-02-06 19:04:36,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:04:36,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:04:36,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:04:36,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:04:36,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,939 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2025-02-06 19:04:36,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,945 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:04:36,956 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:04:36,956 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:04:36,956 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:04:36,957 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (1/1) ... [2025-02-06 19:04:36,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:36,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:36,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:36,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:04:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:04:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:04:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:04:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:04:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:04:37,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:04:37,102 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:04:37,104 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:04:37,247 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-06 19:04:37,250 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:04:37,261 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:04:37,261 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:04:37,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:04:37 BoogieIcfgContainer [2025-02-06 19:04:37,261 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:04:37,262 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:04:37,262 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:04:37,267 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:04:37,268 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:04:37,268 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:04:36" (1/3) ... [2025-02-06 19:04:37,270 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7192b4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:04:37, skipping insertion in model container [2025-02-06 19:04:37,270 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:04:37,270 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:04:36" (2/3) ... [2025-02-06 19:04:37,270 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7192b4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:04:37, skipping insertion in model container [2025-02-06 19:04:37,270 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:04:37,270 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:04:37" (3/3) ... [2025-02-06 19:04:37,273 INFO L363 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca.i [2025-02-06 19:04:37,321 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:04:37,321 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:04:37,321 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:04:37,321 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:04:37,322 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:04:37,322 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:04:37,322 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:04:37,322 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:04:37,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:37,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:04:37,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:37,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:37,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:04:37,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:04:37,349 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:04:37,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:37,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:04:37,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:37,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:37,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:04:37,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:04:37,357 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~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~nondet3#1;call write~int#0(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1;" [2025-02-06 19:04:37,358 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume 0 != main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35;" "assume !main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call write~int#0(0, main_~x~0#1.base, main_~x~0#1.offset, 4);" [2025-02-06 19:04:37,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2025-02-06 19:04:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:37,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125115540] [2025-02-06 19:04:37,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:37,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:37,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:04:37,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:04:37,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:37,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:37,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:37,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:04:37,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:04:37,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:37,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:37,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:37,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:37,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1353343, now seen corresponding path program 1 times [2025-02-06 19:04:37,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:37,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989205633] [2025-02-06 19:04:37,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:37,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:37,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:37,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:37,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:37,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:37,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:37,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:37,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:37,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:37,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:37,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1389405406, now seen corresponding path program 1 times [2025-02-06 19:04:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:37,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361441536] [2025-02-06 19:04:37,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:37,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:04:37,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:04:37,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:37,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:37,564 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:37,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:04:37,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:04:37,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:37,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:37,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:37,931 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:04:37,931 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:04:37,933 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:04:37,934 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:04:37,934 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:04:37,934 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:37,934 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:04:37,934 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:04:37,935 INFO L132 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca.i_Iteration1_Lasso [2025-02-06 19:04:37,935 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:04:37,935 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:04:37,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:37,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:38,311 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:04:38,315 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:04:38,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:38,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:38,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:38,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:04:38,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:38,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:38,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:38,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:38,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:38,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:38,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:38,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:38,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:38,360 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 [2025-02-06 19:04:38,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:38,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:38,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:38,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:04:38,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:38,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:38,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:38,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:38,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:38,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:38,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:38,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:38,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-06 19:04:38,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:38,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:38,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:38,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:04:38,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:38,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:38,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:38,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:38,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:38,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:38,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:38,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:38,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:04:38,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:38,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:38,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:38,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:04:38,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:38,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:38,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:38,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:38,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:38,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:38,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:38,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:38,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:38,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:38,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:38,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:38,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:04:38,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:38,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:38,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:38,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:38,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:38,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:38,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:38,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:38,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:04:38,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:38,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:38,519 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:38,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:04:38,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:38,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:38,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:38,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:38,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:38,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:38,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:38,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:38,541 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:04:38,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:04:38,550 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:04:38,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:38,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:38,558 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:38,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:04:38,559 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:04:38,560 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:04:38,560 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:04:38,560 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 Supporting invariants [] [2025-02-06 19:04:38,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:38,572 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-02-06 19:04:38,577 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:04:38,578 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:04:38,578 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2025-02-06 19:04:38,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:38,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:04:38,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:04:38,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:38,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:38,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:04:38,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:38,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:38,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:38,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:38,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:38,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:04:38,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:38,732 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:04:38,734 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:38,807 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 1.5) internal successors, (6), 4 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 37 states and 54 transitions. Complement of second has 8 states. [2025-02-06 19:04:38,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:04:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2025-02-06 19:04:38,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-06 19:04:38,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:38,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-06 19:04:38,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:38,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 8 letters. [2025-02-06 19:04:38,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:38,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 54 transitions. [2025-02-06 19:04:38,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-02-06 19:04:38,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 37 transitions. [2025-02-06 19:04:38,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-06 19:04:38,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-06 19:04:38,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 37 transitions. [2025-02-06 19:04:38,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:04:38,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 37 transitions. [2025-02-06 19:04:38,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 37 transitions. [2025-02-06 19:04:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-02-06 19:04:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2025-02-06 19:04:38,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 36 transitions. [2025-02-06 19:04:38,856 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2025-02-06 19:04:38,856 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:04:38,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2025-02-06 19:04:38,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-02-06 19:04:38,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:38,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:38,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:04:38,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:04:38,858 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~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~nondet3#1;call write~int#0(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1;" "assume true;call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" [2025-02-06 19:04:38,858 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 != main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35;" "assume main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call main_#t~mem8#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !(main_#t~mem8#1 < 0);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !(main_#t~mem9#1 > 30);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem10#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem10#1;" "assume true;call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" [2025-02-06 19:04:38,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash 46638, now seen corresponding path program 1 times [2025-02-06 19:04:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:38,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205574320] [2025-02-06 19:04:38,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:38,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:04:38,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:04:38,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:38,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:38,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:38,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:04:38,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:04:38,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:38,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:38,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:38,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:38,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1267254501, now seen corresponding path program 1 times [2025-02-06 19:04:38,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:38,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059278150] [2025-02-06 19:04:38,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:38,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:38,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:04:38,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:04:38,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:38,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:38,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:38,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:04:38,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:04:38,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:38,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:38,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1176593746, now seen corresponding path program 1 times [2025-02-06 19:04:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:38,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241245207] [2025-02-06 19:04:38,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:38,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:04:38,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:04:38,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:38,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:38,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:38,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:04:38,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:04:38,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:38,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:38,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:39,230 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:04:39,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:04:39,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:04:39,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:04:39,231 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:04:39,231 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:39,231 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:04:39,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:04:39,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca.i_Iteration2_Lasso [2025-02-06 19:04:39,231 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:04:39,231 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:04:39,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:04:39,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:39,586 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:04:39,586 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:04:39,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:39,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:39,591 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:39,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:04:39,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:39,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:39,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:39,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:39,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:39,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:39,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:39,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:39,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:39,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:39,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:39,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:39,619 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:39,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:04:39,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:39,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:39,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:39,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:39,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:39,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:39,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:39,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:39,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:39,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:04:39,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:39,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:39,641 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:39,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:04:39,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:39,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:39,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:39,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:39,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:39,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:39,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:39,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:39,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-06 19:04:39,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:39,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:39,669 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:39,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:04:39,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:39,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:39,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:39,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:39,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:39,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:39,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:39,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:39,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:39,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:39,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:39,701 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:39,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:04:39,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:39,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:39,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:39,713 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:04:39,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:39,728 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-06 19:04:39,729 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:04:39,749 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:04:39,785 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-02-06 19:04:39,786 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-02-06 19:04:39,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:39,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:39,788 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:39,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:04:39,792 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:04:39,807 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 4. [2025-02-06 19:04:39,807 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:04:39,807 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 Supporting invariants [1*ULTIMATE.start_main_#t~mem4#1 - 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 >= 0, -1*ULTIMATE.start_main_#t~mem4#1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 >= 0] [2025-02-06 19:04:39,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 19:04:39,828 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-02-06 19:04:39,829 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:04:39,829 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:04:39,829 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2025-02-06 19:04:39,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:39,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:04:39,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:04:39,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:39,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:39,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:04:39,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:39,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:04:39,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:04:39,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:39,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:39,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:04:39,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:39,945 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 43 treesize of output 16 [2025-02-06 19:04:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:39,957 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-02-06 19:04:39,957 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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) [2025-02-06 19:04:40,009 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 36 transitions. cyclomatic complexity: 15. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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 53 states and 76 transitions. Complement of second has 9 states. [2025-02-06 19:04:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 19:04:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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) [2025-02-06 19:04:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-02-06 19:04:40,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-06 19:04:40,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:40,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 9 letters. Loop has 6 letters. [2025-02-06 19:04:40,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:40,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 12 letters. [2025-02-06 19:04:40,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:40,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 76 transitions. [2025-02-06 19:04:40,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-02-06 19:04:40,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 50 states and 72 transitions. [2025-02-06 19:04:40,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-02-06 19:04:40,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-06 19:04:40,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 72 transitions. [2025-02-06 19:04:40,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:04:40,015 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-02-06 19:04:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 72 transitions. [2025-02-06 19:04:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-02-06 19:04:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.446808510638298) internal successors, (68), 46 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-02-06 19:04:40,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-02-06 19:04:40,019 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-02-06 19:04:40,019 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:04:40,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 68 transitions. [2025-02-06 19:04:40,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-02-06 19:04:40,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:40,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:40,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:04:40,020 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:04:40,020 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~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~nondet3#1;call write~int#0(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1;" "assume true;call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume 0 != main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1;" "assume !main_#t~short7#1;" "assume !main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call write~int#0(0, main_~x~0#1.base, main_~x~0#1.offset, 4);" [2025-02-06 19:04:40,020 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume 0 != main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35;" "assume !main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call write~int#0(0, main_~x~0#1.base, main_~x~0#1.offset, 4);" [2025-02-06 19:04:40,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1389405437, now seen corresponding path program 1 times [2025-02-06 19:04:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:40,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775371043] [2025-02-06 19:04:40,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:40,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:04:40,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:04:40,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:40,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:04:40,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:04:40,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:40,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1353343, now seen corresponding path program 2 times [2025-02-06 19:04:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:40,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804975513] [2025-02-06 19:04:40,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:04:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:40,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:40,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:40,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:04:40,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:40,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:04:40,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:04:40,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:40,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2144497019, now seen corresponding path program 1 times [2025-02-06 19:04:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:40,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633382279] [2025-02-06 19:04:40,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:40,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:40,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:04:40,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:04:40,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:40,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:04:40,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633382279] [2025-02-06 19:04:40,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633382279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:04:40,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:04:40,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:04:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405875239] [2025-02-06 19:04:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:04:40,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:04:40,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:04:40,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:04:40,273 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. cyclomatic complexity: 26 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:04:40,307 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-02-06 19:04:40,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2025-02-06 19:04:40,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:04:40,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 22 states and 30 transitions. [2025-02-06 19:04:40,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-06 19:04:40,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-06 19:04:40,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2025-02-06 19:04:40,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:04:40,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-02-06 19:04:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2025-02-06 19:04:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-02-06 19:04:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2025-02-06 19:04:40,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-02-06 19:04:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:04:40,318 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-02-06 19:04:40,319 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:04:40,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2025-02-06 19:04:40,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:04:40,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:40,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:40,319 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:40,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:04:40,320 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~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~nondet3#1;call write~int#0(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1;" "assume true;call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume 0 != main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1;" "assume !main_#t~short7#1;" "assume main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call main_#t~mem8#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem8#1 < 0;havoc main_#t~mem8#1;call write~int#0(-5, main_~x~0#1.base, main_~x~0#1.offset, 4);" [2025-02-06 19:04:40,320 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume 0 != main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35;" "assume main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call main_#t~mem8#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem8#1 < 0;havoc main_#t~mem8#1;call write~int#0(-5, main_~x~0#1.base, main_~x~0#1.offset, 4);" [2025-02-06 19:04:40,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:40,320 INFO L85 PathProgramCache]: Analyzing trace with hash 121895558, now seen corresponding path program 1 times [2025-02-06 19:04:40,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:40,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937288180] [2025-02-06 19:04:40,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:40,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:04:40,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:04:40,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:40,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-06 19:04:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:40,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:04:40,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937288180] [2025-02-06 19:04:40,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937288180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:04:40,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:04:40,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:04:40,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352714506] [2025-02-06 19:04:40,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:04:40,376 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:04:40,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash 41953604, now seen corresponding path program 1 times [2025-02-06 19:04:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:40,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313812825] [2025-02-06 19:04:40,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:40,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:04:40,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:04:40,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:40,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:04:40,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:04:40,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:40,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:04:40,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:04:40,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:04:40,481 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:04:40,487 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-02-06 19:04:40,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2025-02-06 19:04:40,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:04:40,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 26 transitions. [2025-02-06 19:04:40,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-06 19:04:40,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-06 19:04:40,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2025-02-06 19:04:40,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:04:40,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-02-06 19:04:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2025-02-06 19:04:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-06 19:04:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:04:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-02-06 19:04:40,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-02-06 19:04:40,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:04:40,493 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-02-06 19:04:40,493 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:04:40,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2025-02-06 19:04:40,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:04:40,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:40,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:40,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:40,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:04:40,494 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~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~nondet3#1;call write~int#0(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1;" "assume true;call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume 0 != main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35;" "assume main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call main_#t~mem8#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem8#1 < 0;havoc main_#t~mem8#1;call write~int#0(-5, main_~x~0#1.base, main_~x~0#1.offset, 4);" [2025-02-06 19:04:40,494 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume 0 != main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35;" "assume main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call main_#t~mem8#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume main_#t~mem8#1 < 0;havoc main_#t~mem8#1;call write~int#0(-5, main_~x~0#1.base, main_~x~0#1.offset, 4);" [2025-02-06 19:04:40,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:40,495 INFO L85 PathProgramCache]: Analyzing trace with hash 121894597, now seen corresponding path program 1 times [2025-02-06 19:04:40,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:40,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122209457] [2025-02-06 19:04:40,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:40,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:40,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:04:40,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:04:40,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:40,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:04:40,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:04:40,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:40,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash 41953604, now seen corresponding path program 2 times [2025-02-06 19:04:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:40,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590334293] [2025-02-06 19:04:40,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:04:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:40,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:04:40,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:04:40,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:04:40,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:40,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:04:40,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:04:40,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:40,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash 599510272, now seen corresponding path program 2 times [2025-02-06 19:04:40,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:40,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649327133] [2025-02-06 19:04:40,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:04:40,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:40,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 19:04:40,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:04:40,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:04:40,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:40,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:04:40,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:04:40,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:40,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:04:40,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:04:40,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:40,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:04:40,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:04:40,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:40,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:40,898 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-02-06 19:04:40,899 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-02-06 19:04:40,909 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-02-06 19:04:40,909 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-02-06 19:04:40,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:04:40 BoogieIcfgContainer [2025-02-06 19:04:40,910 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:04:40,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:04:40,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:04:40,911 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:04:40,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:04:37" (3/4) ... [2025-02-06 19:04:40,914 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-06 19:04:40,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-02-06 19:04:40,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-02-06 19:04:40,952 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 19:04:40,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:04:40,955 INFO L158 Benchmark]: Toolchain (without parser) took 4383.62ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.0MB in the beginning and 348.1MB in the end (delta: -236.1MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2025-02-06 19:04:40,955 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:04:40,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.16ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 95.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:04:40,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.87ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:04:40,956 INFO L158 Benchmark]: Boogie Preprocessor took 37.42ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 93.4MB in the end (delta: 918.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:04:40,956 INFO L158 Benchmark]: IcfgBuilder took 305.84ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 81.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:04:40,957 INFO L158 Benchmark]: BuchiAutomizer took 3647.66ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 81.1MB in the beginning and 351.1MB in the end (delta: -269.9MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2025-02-06 19:04:40,957 INFO L158 Benchmark]: Witness Printer took 42.08ms. Allocated memory is still 427.8MB. Free memory was 351.1MB in the beginning and 348.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:04:40,959 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.16ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 95.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.87ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.42ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 93.4MB in the end (delta: 918.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 305.84ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 81.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3647.66ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 81.1MB in the beginning and 351.1MB in the end (delta: -269.9MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Witness Printer took 42.08ms. Allocated memory is still 427.8MB. Free memory was 351.1MB in the beginning and 348.1MB in the end (delta: 3.0MB). 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[~x~0!base,]]] - 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[~x~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 33 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital108 mio100 ax116 hnf100 lsp85 ukn62 mio100 lsp32 div100 bol100 ite100 ukn100 eq177 hnf92 smp100 dnf128 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 107ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 551]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] COND TRUE *x != 0 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 VAL [x={2:0}] [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 VAL [x={2:0}] [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 Loop: [L551] COND TRUE *x != 0 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 551]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] COND TRUE *x != 0 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 VAL [x={2:0}] [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 VAL [x={2:0}] [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 Loop: [L551] COND TRUE *x != 0 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-06 19:04:40,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)