./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d 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-crafted/4BitCounterPointer.c -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 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:17:39,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:17:39,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:17:39,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:17:39,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:17:39,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:17:39,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:17:39,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:17:39,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:17:39,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:17:39,532 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:17:39,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:17:39,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:17:39,532 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:17:39,532 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:17:39,533 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:17:39,533 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:17:39,533 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:17:39,533 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:17:39,533 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:17:39,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:17:39,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:17:39,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:17:39,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:17:39,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:17:39,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:17:39,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:17:39,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:17:39,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:17:39,534 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:17:39,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:17:39,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:17:39,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:17:39,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:17:39,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:17:39,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:17:39,535 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:17:39,536 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 -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2025-02-08 14:17:39,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:17:39,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:17:39,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:17:39,773 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:17:39,773 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:17:39,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2025-02-08 14:17:40,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b7115964/6cf2622c8dd3496a86e32689d2b0bd3e/FLAG2b09233fa [2025-02-08 14:17:41,230 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:17:41,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2025-02-08 14:17:41,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b7115964/6cf2622c8dd3496a86e32689d2b0bd3e/FLAG2b09233fa [2025-02-08 14:17:41,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b7115964/6cf2622c8dd3496a86e32689d2b0bd3e [2025-02-08 14:17:41,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:17:41,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:17:41,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:17:41,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:17:41,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:17:41,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696966db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41, skipping insertion in model container [2025-02-08 14:17:41,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:17:41,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:17:41,410 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:17:41,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:17:41,431 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:17:41,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41 WrapperNode [2025-02-08 14:17:41,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:17:41,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:17:41,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:17:41,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:17:41,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,454 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-02-08 14:17:41,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:17:41,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:17:41,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:17:41,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:17:41,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,479 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [4, 3, 4, 4]. 27 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 11 writes are split as follows [3, 2, 3, 3]. [2025-02-08 14:17:41,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:17:41,492 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:17:41,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:17:41,492 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:17:41,492 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (1/1) ... [2025-02-08 14:17:41,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:41,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:41,518 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-08 14:17:41,520 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-08 14:17:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:17:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:17:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:17:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:17:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:17:41,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:17:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:17:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:17:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:17:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:17:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:17:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:17:41,596 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:17:41,597 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:17:41,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7: call ULTIMATE.dealloc(main_#t~malloc0#1.base, main_#t~malloc0#1.offset);havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call ULTIMATE.dealloc(main_#t~malloc1#1.base, main_#t~malloc1#1.offset);havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call ULTIMATE.dealloc(main_#t~malloc2#1.base, main_#t~malloc2#1.offset);havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; [2025-02-08 14:17:41,742 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-08 14:17:41,742 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:17:41,748 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:17:41,748 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:17:41,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:17:41 BoogieIcfgContainer [2025-02-08 14:17:41,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:17:41,749 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:17:41,749 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:17:41,753 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:17:41,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:17:41,753 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:17:41" (1/3) ... [2025-02-08 14:17:41,754 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ccc85bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:17:41, skipping insertion in model container [2025-02-08 14:17:41,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:17:41,754 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:17:41" (2/3) ... [2025-02-08 14:17:41,754 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ccc85bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:17:41, skipping insertion in model container [2025-02-08 14:17:41,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:17:41,754 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:17:41" (3/3) ... [2025-02-08 14:17:41,755 INFO L363 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2025-02-08 14:17:41,790 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:17:41,790 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:17:41,790 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:17:41,791 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:17:41,791 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:17:41,791 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:17:41,791 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:17:41,791 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:17:41,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:41,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:17:41,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:41,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:41,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:17:41,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:17:41,806 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:17:41,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:41,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:17:41,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:41,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:41,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:17:41,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:17:41,811 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-02-08 14:17:41,812 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-02-08 14:17:41,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 1 times [2025-02-08 14:17:41,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:41,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792988776] [2025-02-08 14:17:41,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:41,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:41,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:41,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:41,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:41,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:41,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:41,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:41,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:41,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:41,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:41,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:42,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:42,000 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 1 times [2025-02-08 14:17:42,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:42,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197756207] [2025-02-08 14:17:42,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:42,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:42,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:42,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:42,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:42,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:42,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:42,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:42,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:42,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:42,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:42,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1414038, now seen corresponding path program 1 times [2025-02-08 14:17:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:42,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766168792] [2025-02-08 14:17:42,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:42,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:42,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:42,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:42,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:42,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:42,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:42,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:42,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:42,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:42,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:43,034 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:43,034 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:43,035 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:43,035 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:43,035 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:17:43,035 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:43,035 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:43,035 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:43,035 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2025-02-08 14:17:43,035 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:43,035 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:43,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:43,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:43,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:43,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:43,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:43,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:43,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:44,037 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:44,043 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:17:44,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:44,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:44,051 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-08 14:17:44,053 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-08 14:17:44,054 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-08 14:17:44,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:44,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:44,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:44,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:44,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:44,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:44,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:44,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:44,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:44,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:44,097 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-08 14:17:44,102 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-08 14:17:44,102 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-08 14:17:44,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:44,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:44,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:44,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:44,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:44,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:44,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:44,130 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-08 14:17:44,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:44,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:44,133 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-08 14:17:44,135 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-08 14:17:44,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:17:44,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:44,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:44,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:44,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:44,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:44,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:44,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:44,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:44,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:44,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:44,159 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-08 14:17:44,161 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-08 14:17:44,162 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-08 14:17:44,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:44,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:44,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:44,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:44,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:44,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:44,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:44,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-08 14:17:44,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:44,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:44,188 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-08 14:17:44,189 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-08 14:17:44,191 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-08 14:17:44,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:44,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:44,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:44,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:44,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:44,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:44,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:44,213 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-08 14:17:44,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:44,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:44,215 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-08 14:17:44,217 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-08 14:17:44,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:17:44,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:44,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:44,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:44,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:44,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:44,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:44,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:44,246 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-08 14:17:44,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:44,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:44,249 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-08 14:17:44,250 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-08 14:17:44,251 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-08 14:17:44,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:44,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:44,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:44,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:44,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:44,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:44,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:44,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:44,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:44,273 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-08 14:17:44,274 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-08 14:17:44,275 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-08 14:17:44,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:44,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:44,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:44,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:44,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:44,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:44,292 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:17:44,307 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-08 14:17:44,309 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-08 14:17:44,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:44,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:44,316 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-08 14:17:44,318 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-08 14:17:44,319 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:17:44,341 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:17:44,341 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:17:44,341 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2025-02-08 14:17:44,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-08 14:17:44,415 INFO L156 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2025-02-08 14:17:44,420 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-08 14:17:44,420 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-08 14:17:44,421 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2025-02-08 14:17:44,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:44,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:17:44,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:17:44,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:44,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:44,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:44,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:44,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:44,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:44,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:44,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:44,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:17:44,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:44,481 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-08 14:17:44,509 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-08 14:17:44,510 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:44,544 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 32 transitions. Complement of second has 8 states. [2025-02-08 14:17:44,545 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-08 14:17:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-02-08 14:17:44,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 1 letters. Loop has 3 letters. [2025-02-08 14:17:44,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:44,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2025-02-08 14:17:44,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:44,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 1 letters. Loop has 6 letters. [2025-02-08 14:17:44,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:44,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 32 transitions. [2025-02-08 14:17:44,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:17:44,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 12 states and 17 transitions. [2025-02-08 14:17:44,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:17:44,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:17:44,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-02-08 14:17:44,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:44,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-08 14:17:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-02-08 14:17:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-08 14:17:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) 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-08 14:17:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-02-08 14:17:44,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-08 14:17:44,569 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-08 14:17:44,569 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:17:44,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-02-08 14:17:44,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:17:44,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:44,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:44,570 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:17:44,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:17:44,571 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-08 14:17:44,571 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-08 14:17:44,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:44,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1414043, now seen corresponding path program 1 times [2025-02-08 14:17:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:44,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18640656] [2025-02-08 14:17:44,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:44,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:44,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:44,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:44,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:44,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:44,727 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-08 14:17:44,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:17:44,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18640656] [2025-02-08 14:17:44,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18640656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:17:44,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:17:44,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:17:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662303905] [2025-02-08 14:17:44,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:17:44,733 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:17:44,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1086342, now seen corresponding path program 1 times [2025-02-08 14:17:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:44,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881670866] [2025-02-08 14:17:44,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:44,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:44,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:44,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:44,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:44,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:44,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:44,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:17:44,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:17:44,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:44,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:44,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:44,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:44,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:17:44,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:17:44,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:17:44,931 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:17:44,962 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2025-02-08 14:17:44,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2025-02-08 14:17:44,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:17:44,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 21 transitions. [2025-02-08 14:17:44,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-08 14:17:44,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-08 14:17:44,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2025-02-08 14:17:44,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:44,963 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-08 14:17:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2025-02-08 14:17:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2025-02-08 14:17:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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-08 14:17:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-02-08 14:17:44,964 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-02-08 14:17:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:17:44,969 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-02-08 14:17:44,969 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:17:44,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-02-08 14:17:44,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:17:44,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:44,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:44,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2025-02-08 14:17:44,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2025-02-08 14:17:44,970 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-08 14:17:44,970 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-08 14:17:44,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash -824053036, now seen corresponding path program 1 times [2025-02-08 14:17:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:44,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138637096] [2025-02-08 14:17:44,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:44,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:44,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:17:45,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:17:45,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:45,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:45,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:45,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:17:45,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:17:45,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:45,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:45,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:45,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:45,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1996658935, now seen corresponding path program 1 times [2025-02-08 14:17:45,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:45,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336643338] [2025-02-08 14:17:45,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:45,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:45,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:17:45,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:17:45,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:45,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:45,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:45,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:17:45,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:17:45,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:45,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:45,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:45,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash -436260650, now seen corresponding path program 1 times [2025-02-08 14:17:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:45,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178505827] [2025-02-08 14:17:45,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:45,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:45,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:17:45,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:17:45,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:45,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:45,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:45,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:17:45,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:17:45,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:45,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:45,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:46,275 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:46,275 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:46,275 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:46,275 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:46,276 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:17:46,276 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:46,276 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:46,276 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:46,276 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2025-02-08 14:17:46,276 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:46,276 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:46,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:46,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:46,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:46,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:46,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:47,178 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:47,178 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:17:47,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,184 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-08 14:17:47,185 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-08 14:17:47,185 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-08 14:17:47,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:17:47,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:17:47,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:17:47,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,204 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-08 14:17:47,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,207 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-08 14:17:47,208 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-08 14:17:47,210 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-08 14:17:47,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-08 14:17:47,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,239 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-08 14:17:47,240 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-08 14:17:47,242 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-08 14:17:47,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,262 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-08 14:17:47,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,264 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-08 14:17:47,266 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-08 14:17:47,267 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-08 14:17:47,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,295 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-08 14:17:47,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,297 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:17:47,299 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-08 14:17:47,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-08 14:17:47,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,322 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:17:47,325 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-08 14:17:47,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:47,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,350 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:17:47,353 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-08 14:17:47,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-08 14:17:47,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,381 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:17:47,388 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-08 14:17:47,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:47,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,416 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-08 14:17:47,443 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-08 14:17:47,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:47,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,469 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-08 14:17:47,471 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-08 14:17:47,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,485 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:47,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,493 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-08 14:17:47,496 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-08 14:17:47,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:47,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,522 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-08 14:17:47,525 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-08 14:17:47,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:47,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,547 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:17:47,550 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-08 14:17:47,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:47,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,571 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-08 14:17:47,574 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-08 14:17:47,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:47,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:47,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,603 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-08 14:17:47,606 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-08 14:17:47,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:47,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:47,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:47,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:47,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:47,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:47,625 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:17:47,647 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-02-08 14:17:47,648 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-08 14:17:47,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:47,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:47,650 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:47,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-08 14:17:47,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:17:47,664 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:17:47,664 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:17:47,664 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem6#1) = -2*ULTIMATE.start_main_#t~mem6#1 + 1 Supporting invariants [] [2025-02-08 14:17:47,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:47,750 INFO L156 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2025-02-08 14:17:47,751 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2025-02-08 14:17:47,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:47,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:17:47,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:17:47,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:47,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:47,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:47,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:47,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:17:47,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:17:47,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:47,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:47,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 14:17:47,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:47,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:17:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:17:47,854 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-08 14:17:47,854 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-08 14:17:47,866 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 30 states and 40 transitions. Complement of second has 5 states. [2025-02-08 14:17:47,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:17:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-08 14:17:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-02-08 14:17:47,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 7 letters. [2025-02-08 14:17:47,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:47,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 7 letters. [2025-02-08 14:17:47,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:47,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 14 letters. [2025-02-08 14:17:47,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:47,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2025-02-08 14:17:47,869 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-02-08 14:17:47,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 40 transitions. [2025-02-08 14:17:47,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-08 14:17:47,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-02-08 14:17:47,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2025-02-08 14:17:47,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:47,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-02-08 14:17:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2025-02-08 14:17:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-02-08 14:17:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 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-08 14:17:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-02-08 14:17:47,874 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-02-08 14:17:47,874 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-02-08 14:17:47,874 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:17:47,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2025-02-08 14:17:47,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-02-08 14:17:47,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:47,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:47,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-02-08 14:17:47,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:17:47,876 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-08 14:17:47,876 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-02-08 14:17:47,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 224159665, now seen corresponding path program 2 times [2025-02-08 14:17:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:47,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327238932] [2025-02-08 14:17:47,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:17:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:47,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-08 14:17:47,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:47,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:17:47,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:47,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:47,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:47,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:47,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:47,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:47,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:47,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 2 times [2025-02-08 14:17:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436652422] [2025-02-08 14:17:47,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:17:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:47,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:47,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:47,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:17:47,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:47,931 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:47,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:47,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:47,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:47,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:47,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:47,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash -733551404, now seen corresponding path program 3 times [2025-02-08 14:17:47,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:47,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501367411] [2025-02-08 14:17:47,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:17:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:47,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 3 equivalence classes. [2025-02-08 14:17:47,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:17:47,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:17:47,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:47,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:47,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:17:47,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:17:47,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:47,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:47,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:49,070 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:49,070 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:49,070 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:49,070 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:49,070 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:17:49,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:49,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:49,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2025-02-08 14:17:49,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:49,070 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:49,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:49,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-08 14:17:49,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:49,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:49,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:49,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:49,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:49,678 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:49,678 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:17:49,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,683 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:49,686 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-08 14:17:49,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-08 14:17:49,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:49,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,723 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:49,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:17:49,725 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-08 14:17:49,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-08 14:17:49,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,750 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:49,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-08 14:17:49,752 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-08 14:17:49,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,777 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:49,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-08 14:17:49,779 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-08 14:17:49,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:49,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,801 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:17:49,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-08 14:17:49,806 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-08 14:17:49,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-08 14:17:49,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,843 INFO L229 MonitoredProcess]: Starting monitored process 32 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-08 14:17:49,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-08 14:17:49,846 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-08 14:17:49,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:49,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,869 INFO L229 MonitoredProcess]: Starting monitored process 33 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-08 14:17:49,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-08 14:17:49,871 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-08 14:17:49,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-08 14:17:49,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,892 INFO L229 MonitoredProcess]: Starting monitored process 34 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-08 14:17:49,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-08 14:17:49,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:17:49,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-08 14:17:49,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,919 INFO L229 MonitoredProcess]: Starting monitored process 35 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-08 14:17:49,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-08 14:17:49,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:17:49,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:49,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,945 INFO L229 MonitoredProcess]: Starting monitored process 36 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-08 14:17:49,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-08 14:17:49,951 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-08 14:17:49,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:49,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,972 INFO L229 MonitoredProcess]: Starting monitored process 37 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-08 14:17:49,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-08 14:17:49,975 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-08 14:17:49,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:49,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:49,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:49,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:49,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:49,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:49,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:49,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:49,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:49,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:49,998 INFO L229 MonitoredProcess]: Starting monitored process 38 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-08 14:17:49,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-08 14:17:50,000 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-08 14:17:50,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:50,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:50,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:50,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:50,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:50,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:50,018 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:17:50,024 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-02-08 14:17:50,025 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-02-08 14:17:50,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:50,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:50,027 INFO L229 MonitoredProcess]: Starting monitored process 39 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-08 14:17:50,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-08 14:17:50,030 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:17:50,040 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:17:50,040 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:17:50,040 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3 + 1 Supporting invariants [] [2025-02-08 14:17:50,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:50,146 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2025-02-08 14:17:50,147 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-08 14:17:50,147 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-08 14:17:50,147 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2025-02-08 14:17:50,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:50,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:50,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:50,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:50,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:50,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:50,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:50,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:50,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:50,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:50,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:50,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:17:50,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:50,275 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-08 14:17:50,279 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-08 14:17:50,279 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:50,312 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 75 transitions. Complement of second has 7 states. [2025-02-08 14:17:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:17:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-02-08 14:17:50,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-08 14:17:50,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:50,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 11 letters. Loop has 3 letters. [2025-02-08 14:17:50,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:50,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 6 letters. [2025-02-08 14:17:50,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:50,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 75 transitions. [2025-02-08 14:17:50,319 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2025-02-08 14:17:50,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 50 states and 63 transitions. [2025-02-08 14:17:50,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-08 14:17:50,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-02-08 14:17:50,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 63 transitions. [2025-02-08 14:17:50,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:50,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 63 transitions. [2025-02-08 14:17:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 63 transitions. [2025-02-08 14:17:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-02-08 14:17:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 45 states have internal predecessors, (59), 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-08 14:17:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2025-02-08 14:17:50,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-02-08 14:17:50,326 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-02-08 14:17:50,326 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:17:50,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2025-02-08 14:17:50,327 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2025-02-08 14:17:50,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:50,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:50,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-02-08 14:17:50,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2025-02-08 14:17:50,327 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-02-08 14:17:50,327 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-02-08 14:17:50,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash 224159668, now seen corresponding path program 1 times [2025-02-08 14:17:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:50,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540764784] [2025-02-08 14:17:50,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:50,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:50,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:50,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:50,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:50,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:17:50,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:17:50,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540764784] [2025-02-08 14:17:50,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540764784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:17:50,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:17:50,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:17:50,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428667023] [2025-02-08 14:17:50,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:17:50,411 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:17:50,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash -24074498, now seen corresponding path program 1 times [2025-02-08 14:17:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:50,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435826260] [2025-02-08 14:17:50,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:50,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:50,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:50,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:50,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:50,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:50,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:17:50,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:17:50,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:50,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:50,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:50,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:17:50,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:17:50,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:17:50,769 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:17:50,785 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-02-08 14:17:50,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2025-02-08 14:17:50,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-02-08 14:17:50,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2025-02-08 14:17:50,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-02-08 14:17:50,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-08 14:17:50,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2025-02-08 14:17:50,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:50,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-02-08 14:17:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2025-02-08 14:17:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-08 14:17:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 38 states have internal predecessors, (48), 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-08 14:17:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-02-08 14:17:50,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-02-08 14:17:50,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:17:50,795 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-02-08 14:17:50,795 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:17:50,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2025-02-08 14:17:50,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-02-08 14:17:50,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:50,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:50,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1] [2025-02-08 14:17:50,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:17:50,799 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-08 14:17:50,799 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-02-08 14:17:50,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:50,800 INFO L85 PathProgramCache]: Analyzing trace with hash -639178257, now seen corresponding path program 4 times [2025-02-08 14:17:50,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:50,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448281355] [2025-02-08 14:17:50,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:17:50,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:50,821 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-02-08 14:17:50,830 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:17:50,831 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:17:50,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:17:50,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:17:50,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448281355] [2025-02-08 14:17:50,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448281355] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:17:50,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520528140] [2025-02-08 14:17:50,971 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:17:50,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:17:50,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:50,973 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:17:50,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-02-08 14:17:51,010 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-02-08 14:17:51,027 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:17:51,027 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:17:51,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:51,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:17:51,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:51,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:17:51,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:17:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:17:51,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:17:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520528140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:17:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:17:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-08 14:17:51,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073076438] [2025-02-08 14:17:51,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:17:51,057 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:17:51,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 3 times [2025-02-08 14:17:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:51,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406770734] [2025-02-08 14:17:51,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:17:51,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:51,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:51,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:51,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:17:51,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:51,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:51,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:51,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:51,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:51,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:51,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:51,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:17:51,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:17:51,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:17:51,110 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. cyclomatic complexity: 14 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:17:51,124 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-02-08 14:17:51,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2025-02-08 14:17:51,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-02-08 14:17:51,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 35 transitions. [2025-02-08 14:17:51,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-08 14:17:51,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-08 14:17:51,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2025-02-08 14:17:51,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:51,125 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-02-08 14:17:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2025-02-08 14:17:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-02-08 14:17:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-08 14:17:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-08 14:17:51,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-08 14:17:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:17:51,127 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-08 14:17:51,127 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:17:51,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2025-02-08 14:17:51,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-02-08 14:17:51,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:51,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:51,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1] [2025-02-08 14:17:51,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2025-02-08 14:17:51,128 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-08 14:17:51,128 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-08 14:17:51,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash -436260650, now seen corresponding path program 5 times [2025-02-08 14:17:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:51,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855887543] [2025-02-08 14:17:51,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:17:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:51,135 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 4 equivalence classes. [2025-02-08 14:17:51,142 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:17:51,143 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 14:17:51,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:51,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:51,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:17:51,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:17:51,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:51,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:51,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:51,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1776752198, now seen corresponding path program 1 times [2025-02-08 14:17:51,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:51,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643635144] [2025-02-08 14:17:51,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:51,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:51,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:17:51,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:17:51,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:51,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:51,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:51,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:17:51,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:17:51,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:51,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:51,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:51,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash -302022447, now seen corresponding path program 1 times [2025-02-08 14:17:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:51,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885839387] [2025-02-08 14:17:51,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:51,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:51,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 14:17:51,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 14:17:51,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:51,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:51,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:51,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 14:17:51,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 14:17:51,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:51,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:51,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:52,643 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:17:52,643 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:17:52,643 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:17:52,643 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:17:52,643 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:17:52,643 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:52,643 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:17:52,643 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:17:52,644 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2025-02-08 14:17:52,644 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:17:52,644 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:17:52,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:52,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:52,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:52,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:53,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:17:53,533 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:17:53,533 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:17:53,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,535 INFO L229 MonitoredProcess]: Starting monitored process 41 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-08 14:17:53,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-08 14:17:53,538 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-08 14:17:53,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:17:53,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:17:53,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:17:53,554 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-08 14:17:53,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,564 INFO L229 MonitoredProcess]: Starting monitored process 42 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-08 14:17:53,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-08 14:17:53,567 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-08 14:17:53,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:17:53,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:17:53,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:17:53,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:53,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,589 INFO L229 MonitoredProcess]: Starting monitored process 43 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-08 14:17:53,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-08 14:17:53,592 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-08 14:17:53,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:17:53,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:17:53,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:17:53,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:53,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,613 INFO L229 MonitoredProcess]: Starting monitored process 44 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-08 14:17:53,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-08 14:17:53,617 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-08 14:17:53,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:53,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:53,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:53,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,645 INFO L229 MonitoredProcess]: Starting monitored process 45 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-08 14:17:53,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-08 14:17:53,646 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-08 14:17:53,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:53,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:53,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:53,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,672 INFO L229 MonitoredProcess]: Starting monitored process 46 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-08 14:17:53,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-08 14:17:53,673 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-08 14:17:53,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,683 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:17:53,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,726 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-08 14:17:53,727 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-08 14:17:53,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-02-08 14:17:53,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,748 INFO L229 MonitoredProcess]: Starting monitored process 47 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-08 14:17:53,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-08 14:17:53,750 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-08 14:17:53,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:53,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:53,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:53,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,782 INFO L229 MonitoredProcess]: Starting monitored process 48 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-08 14:17:53,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-08 14:17:53,784 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-08 14:17:53,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:53,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:53,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-08 14:17:53,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,811 INFO L229 MonitoredProcess]: Starting monitored process 49 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-08 14:17:53,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-08 14:17:53,814 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-08 14:17:53,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:53,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:53,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:53,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,841 INFO L229 MonitoredProcess]: Starting monitored process 50 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-08 14:17:53,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-02-08 14:17:53,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:17:53,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:53,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:53,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:53,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,866 INFO L229 MonitoredProcess]: Starting monitored process 51 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-08 14:17:53,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-02-08 14:17:53,869 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-08 14:17:53,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:53,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:53,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:53,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,895 INFO L229 MonitoredProcess]: Starting monitored process 52 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-08 14:17:53,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-02-08 14:17:53,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:17:53,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:53,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:53,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:17:53,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-02-08 14:17:53,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,924 INFO L229 MonitoredProcess]: Starting monitored process 53 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-08 14:17:53,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-02-08 14:17:53,926 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-08 14:17:53,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:17:53,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:17:53,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:17:53,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:17:53,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:17:53,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:17:53,942 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:17:53,951 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-08 14:17:53,952 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-02-08 14:17:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:17:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:53,955 INFO L229 MonitoredProcess]: Starting monitored process 54 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-08 14:17:53,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-02-08 14:17:53,956 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:17:53,968 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:17:53,969 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:17:53,969 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2025-02-08 14:17:53,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-02-08 14:17:54,102 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2025-02-08 14:17:54,104 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-08 14:17:54,104 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-08 14:17:54,104 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2025-02-08 14:17:54,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:54,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:17:54,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:17:54,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:54,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:17:54,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:54,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:17:54,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:17:54,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:54,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:54,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 14:17:54,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:54,190 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 34 treesize of output 11 [2025-02-08 14:17:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 14:17:54,245 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-08 14:17:54,245 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:54,263 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 64 states and 76 transitions. Complement of second has 7 states. [2025-02-08 14:17:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:17:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-02-08 14:17:54,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 15 letters. [2025-02-08 14:17:54,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:54,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 29 letters. Loop has 15 letters. [2025-02-08 14:17:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:54,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 30 letters. [2025-02-08 14:17:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:17:54,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2025-02-08 14:17:54,267 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-02-08 14:17:54,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 76 transitions. [2025-02-08 14:17:54,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-02-08 14:17:54,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-02-08 14:17:54,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 76 transitions. [2025-02-08 14:17:54,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:54,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-02-08 14:17:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 76 transitions. [2025-02-08 14:17:54,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 14:17:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.1875) internal successors, (76), 63 states have internal predecessors, (76), 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-08 14:17:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2025-02-08 14:17:54,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-02-08 14:17:54,270 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-02-08 14:17:54,270 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:17:54,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 76 transitions. [2025-02-08 14:17:54,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-02-08 14:17:54,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:54,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:54,277 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2025-02-08 14:17:54,277 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2025-02-08 14:17:54,277 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-02-08 14:17:54,277 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-02-08 14:17:54,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1660310613, now seen corresponding path program 1 times [2025-02-08 14:17:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:54,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511100449] [2025-02-08 14:17:54,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:54,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:17:54,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:17:54,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:54,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 14:17:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:17:54,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511100449] [2025-02-08 14:17:54,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511100449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:17:54,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:17:54,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:17:54,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133747246] [2025-02-08 14:17:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:17:54,358 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:17:54,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash -624921022, now seen corresponding path program 2 times [2025-02-08 14:17:54,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:54,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074360473] [2025-02-08 14:17:54,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:17:54,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:54,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-08 14:17:54,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:17:54,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:17:54,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:54,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:54,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:17:54,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:17:54,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:54,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:54,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:17:54,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:17:54,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:17:54,751 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. cyclomatic complexity: 19 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:17:54,768 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2025-02-08 14:17:54,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 96 transitions. [2025-02-08 14:17:54,769 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-02-08 14:17:54,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 75 states and 87 transitions. [2025-02-08 14:17:54,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-02-08 14:17:54,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-02-08 14:17:54,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 87 transitions. [2025-02-08 14:17:54,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:54,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 87 transitions. [2025-02-08 14:17:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 87 transitions. [2025-02-08 14:17:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-02-08 14:17:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 72 states have internal predecessors, (85), 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-08 14:17:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2025-02-08 14:17:54,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 85 transitions. [2025-02-08 14:17:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:17:54,776 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 85 transitions. [2025-02-08 14:17:54,776 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:17:54,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 85 transitions. [2025-02-08 14:17:54,777 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-02-08 14:17:54,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:54,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:54,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1] [2025-02-08 14:17:54,777 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:17:54,777 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-02-08 14:17:54,778 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-02-08 14:17:54,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:54,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1470075217, now seen corresponding path program 2 times [2025-02-08 14:17:54,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:54,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931576547] [2025-02-08 14:17:54,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:17:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:54,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 14:17:54,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:17:54,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:17:54,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:54,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:54,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:17:54,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:17:54,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:54,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:54,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:54,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 4 times [2025-02-08 14:17:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:54,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806590312] [2025-02-08 14:17:54,816 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:17:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:54,818 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-08 14:17:54,819 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:54,819 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:17:54,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:54,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:54,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:17:54,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:17:54,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:54,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:54,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:54,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:54,824 INFO L85 PathProgramCache]: Analyzing trace with hash -770713804, now seen corresponding path program 3 times [2025-02-08 14:17:54,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:54,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887904893] [2025-02-08 14:17:54,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:17:54,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:54,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-02-08 14:17:54,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 22 statements. [2025-02-08 14:17:54,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 14:17:54,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 14:17:54,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:17:54,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887904893] [2025-02-08 14:17:54,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887904893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:17:54,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:17:54,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:17:54,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518887898] [2025-02-08 14:17:54,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:17:54,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:17:54,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:17:54,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:17:54,917 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. cyclomatic complexity: 18 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:17:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:17:54,931 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-02-08 14:17:54,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 79 transitions. [2025-02-08 14:17:54,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-02-08 14:17:54,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 73 states and 75 transitions. [2025-02-08 14:17:54,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-02-08 14:17:54,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2025-02-08 14:17:54,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 75 transitions. [2025-02-08 14:17:54,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:17:54,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 75 transitions. [2025-02-08 14:17:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 75 transitions. [2025-02-08 14:17:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-02-08 14:17:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 66 states have internal predecessors, (69), 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-08 14:17:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2025-02-08 14:17:54,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 69 transitions. [2025-02-08 14:17:54,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:17:54,936 INFO L432 stractBuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2025-02-08 14:17:54,936 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:17:54,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 69 transitions. [2025-02-08 14:17:54,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-02-08 14:17:54,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:17:54,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:17:54,937 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 1, 1, 1] [2025-02-08 14:17:54,937 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 4, 4, 2, 2, 1, 1] [2025-02-08 14:17:54,938 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~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-02-08 14:17:54,938 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-02-08 14:17:54,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1814204816, now seen corresponding path program 1 times [2025-02-08 14:17:54,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:54,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419805111] [2025-02-08 14:17:54,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:54,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:54,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 14:17:54,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 14:17:54,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:54,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:54,955 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:54,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 14:17:54,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 14:17:54,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:54,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:54,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:54,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1437690398, now seen corresponding path program 1 times [2025-02-08 14:17:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:54,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749922618] [2025-02-08 14:17:54,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:17:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:54,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 14:17:55,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 14:17:55,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:55,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:55,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:17:55,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 14:17:55,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 14:17:55,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:17:55,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:17:55,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:17:55,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:17:55,023 INFO L85 PathProgramCache]: Analyzing trace with hash 912606001, now seen corresponding path program 2 times [2025-02-08 14:17:55,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:17:55,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781213787] [2025-02-08 14:17:55,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:17:55,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:17:55,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-02-08 14:17:55,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-08 14:17:55,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 14:17:55,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:17:55,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-02-08 14:17:55,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:17:55,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781213787] [2025-02-08 14:17:55,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781213787] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:17:55,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549511109] [2025-02-08 14:17:55,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:17:55,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:17:55,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:17:55,297 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:17:55,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-02-08 14:17:55,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-08 14:17:55,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 14:17:55,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:17:55,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:17:55,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:17:55,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:17:55,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 14:17:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-02-08 14:17:55,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:17:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-02-08 14:17:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549511109] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:17:55,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:17:55,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-08 14:17:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589302645] [2025-02-08 14:17:55,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:17:57,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:17:57,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:17:57,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:17:57,563 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-08 14:17:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:17:57,577 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2025-02-08 14:17:57,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 39 transitions. [2025-02-08 14:17:57,578 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:17:57,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2025-02-08 14:17:57,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:17:57,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:17:57,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:17:57,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:17:57,579 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:17:57,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:17:57,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:17:57,579 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:17:57,582 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:17:57,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:17:57,583 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:17:57,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:17:57,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:17:57 BoogieIcfgContainer [2025-02-08 14:17:57,593 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:17:57,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:17:57,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:17:57,593 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:17:57,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:17:41" (3/4) ... [2025-02-08 14:17:57,599 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:17:57,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:17:57,601 INFO L158 Benchmark]: Toolchain (without parser) took 16344.95ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 105.0MB in the beginning and 324.3MB in the end (delta: -219.3MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2025-02-08 14:17:57,601 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:57,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.43ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 95.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:17:57,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.49ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:57,601 INFO L158 Benchmark]: Boogie Preprocessor took 34.82ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 92.5MB in the end (delta: 751.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:57,601 INFO L158 Benchmark]: IcfgBuilder took 257.09ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 79.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:17:57,602 INFO L158 Benchmark]: BuchiAutomizer took 15843.52ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 79.1MB in the beginning and 324.3MB in the end (delta: -245.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:57,606 INFO L158 Benchmark]: Witness Printer took 6.66ms. Allocated memory is still 377.5MB. Free memory is still 324.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:17:57,607 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.26ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.43ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 95.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.49ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.82ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 92.5MB in the end (delta: 751.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 257.09ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 79.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 15843.52ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 79.1MB in the beginning and 324.3MB in the end (delta: -245.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.66ms. Allocated memory is still 377.5MB. Free memory is still 324.3MB. 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[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - 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[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x2~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.8s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 14.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/22 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 83 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital268 mio100 ax100 hnf100 lsp99 ukn73 mio100 lsp24 div100 bol100 ite100 ukn100 eq164 hnf90 smp100 dnf101 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 69ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:17:57,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-02-08 14:17:57,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-02-08 14:17:58,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE